Efficient Processing of XPath Queries with Structured Overlay Networks

@inproceedings{Skobeltsyn2005EfficientPO,
  title={Efficient Processing of XPath Queries with Structured Overlay Networks},
  author={Gleb Skobeltsyn and Manfred Hauswirth and Karl Aberer},
  booktitle={OTM Conferences},
  year={2005}
}
Non-trivial search predicates beyond mere equality are at the current focus of P2P research. Structured queries, as an important type of non-trivial search, have been studied extensively mainly for unstructured P2P systems so far. As unstructured P2P systems do not use indexing, structured queries are very easy to implement since they can be treated equally to any other type of query. However, this comes at the expense of very high bandwidth consumption and limitations in terms of guarantees… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 27 references

EDUTELLA: a P2P networking infrastructure based on RDF

WWW • 2002
View 4 Excerpts
Highly Influenced

Range queries in trie-structured overlays

Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05) • 2005
View 1 Excerpt

Yumerefendi . The architecture of pier : An internetscale query processor

Jon Kleinberg.
CIDR ’ 05 : Proceedings of the 2 nd Biennial Conference on Innovative Data Systems Research • 2005

A peer-to-peer framework for caching range queries

Proceedings. 20th International Conference on Data Engineering • 2004
View 1 Excerpt

Similar Papers

Loading similar papers…