OntSum: A Semantic Query Routing Scheme in P2P Networks Based on Concise Ontology Indexing

Li, Juan; Vuong, Son T.

doi:10.1109/aina.2007.104

Cited by 17 publications

(14 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Most systems [7,14,20] construct a data summary of neighboring nodes or clusters to make a query forwarding decisions. Some algorithms exchange these filters between nodes to maintain their network [11].…”

Section: Query Evaluation With Approximate Membershipmentioning

confidence: 99%

Opportunistic Linked Data Querying Through Approximate Membership Metadata

Sande

Verborgh

Herwegen

et al. 2015

The Semantic Web - ISWC 2015

View full text Add to dashboard Cite

Abstract.Between dereferencing and the protocol lies a largely unexplored axis of possible interfaces to Linked Data, each with its own combination of trade-offs. One of these interfaces is Triple Pattern Fragments, which allows clients to execute queries against low-cost servers, at the cost of higher bandwidth. Increasing a client's efficiency means lowering the number of requests, which can among others be achieved through additional metadata in responses. We noted that typical query evaluations against Triple Pattern Fragments require a significant portion of membership subqueries, which check the presence of a specific triple, rather than a variable pattern. This paper studies the impact of providing approximate membership functions, i.e., Bloom filters and Golombcoded sets, as extra metadata. In addition to reducing requests, such functions allow to achieve full result recall earlier when temporarily allowing lower precision. Half of the tested queries from a WatDiv benchmark test set could be executed with up to a third fewer requests with only marginally higher server cost. Query times, however, did not improve, likely due to slower metadata generation and transfer. This indicates that approximate membership functions can partly improve the client-side query process with minimal impact on the server and its interface.

show abstract

Section: Query Evaluation With Approximate Membershipmentioning

confidence: 99%

Opportunistic Linked Data Querying Through Approximate Membership Metadata

Sande

Verborgh

Herwegen

et al. 2015

The Semantic Web - ISWC 2015

View full text Add to dashboard Cite

show abstract

“…To avoid these problems, we consider unstructured P2P overlay for our work. Ontsum [11] is another ontology based indexing scheme where heterogeneous ontologies between peers are assumed. This approach however requires computationally expensive ontology generation and ontology mapping techniques to be employed in a distributed setting and allow only RDQL based queries which requires some level of end user expertise to be used.…”

Section: Related Workmentioning

confidence: 99%

“…meaning) to keywords in index resulting in poor search accuracy. Second, the handful of semantic based indexing schemes [11], [13] are either computationally intensive [13] or index size varies largely with the dimensionality of the content [13]. Third, maintaining query based indices (as opposed to simple keyword based indices)in a space efficient manner is challenging in P2P networks.…”

Section: Introductionmentioning

confidence: 99%

“…The process of constructing peer indices is much simpler and consumes less memory and time in constructing them. Among many popular semantic indexing mechanisms OSQR [7], OLI [18], Ontsum [11] The related work most comparable to ours is OSQR [7], a semantic search protocol that maintains total relevant documents reachable through a neighbor for each concept from a reference ontology in its routing index as routing state. The authors propose a mechanism to calculate a conservative estimate of strength of a peer for a multi-concept query based on the number of documents reachable from that peer for each individual query concepts.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

BSI: Bloom Filter-Based Semantic Indexing for Unstructured P2P Networksh

Dissanayaka¹,

Prasad²,

Navathe³

et al. 2015

IJP2P

View full text Add to dashboard Cite

show abstract

“…A number of P2P semantic routing techniques [4][5][6] havealready been proposed in recent years, but a lot of them still use route table to fulfil the query request.…”

Section: Introductionmentioning

confidence: 99%

INS: A Novel P2P Semantic Search Approach Using Interest Attenuation Policy

Zhuoya

2014

Proceedings of the 3rd International Conference on Computer Science and Service System

View full text Add to dashboard Cite

Abstract-Semantic overlay could improve query performance in peer-to-peer (P2P) systems. When peers join or leave frequently, it will lead to network traffic surge, since most semantic search methods maintaining a large number of routing tables. In this paper, we address these problems by proposing Interest Attenuation Search(INS), a novel efficient peer-to-peer semantic search approach based on interest attenuation policy. In INS, the interest attenuation policy is introduced to help peers decide whether to forward messages. Before peer floods the request in semantic overlay network(SON), it will check the history information about the request message, then uses INS to make forwarding decision. Simulation results show that INS significantly improves query performance and reduces the traffic overhead generated by unstable network environment.

show abstract

OntSum: A Semantic Query Routing Scheme in P2P Networks Based on Concise Ontology Indexing

Cited by 17 publications

References 17 publications

Opportunistic Linked Data Querying Through Approximate Membership Metadata

Opportunistic Linked Data Querying Through Approximate Membership Metadata

BSI: Bloom Filter-Based Semantic Indexing for Unstructured P2P Networksh

INS: A Novel P2P Semantic Search Approach Using Interest Attenuation Policy

Contact Info

Product

Resources

About