XML processing in DHT networks

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 606-615

  Abiteboul, Serge ^a   Manolescu, Ioana ^a   Polyzotis, Neoklis ^b   Preda, Nicoleta ^a   Sun, Chong ^b  

^a INRIA   (France)

^b University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; DATA TRANSFER; INFORMATION MANAGEMENT; MARKUP LANGUAGES; QUERY PROCESSING; TECHNOLOGY; TELECOMMUNICATION NETWORKS; XML;

BLOOM FILTERING; COMMUNICATION PRIMITIVES; DATA ENGINEERING; DISTRIBUTED HASH TABLES; EFFICIENT ALGORITHMS; INTERNATIONAL CONFERENCES; MASSIVE DATA; P2P NETWORKS; PERFORMANCE LIMITATIONS; SCALABLE MANAGEMENT; SPEED UPS; XML DATA; XML PROCESSING;

DATA PROCESSING;

EID: 52649157618     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497469     Document Type: Conference Paper

References (27)

1. S. Abiteboul, I. Manolescu, and N. Preda, "Constructing and querying peer-to-peer warehouses of XML resources." in SWDB, 2004.
2. R. Huebsch, B. Chun, J. Hellerstein, B. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica, and A. Yumerefendi, "The architecture of PIER: an internet-scale query processor," in CIDR, 2005. [Online]. Available: citeseer.ist.psu.edu/article/huebsch05architecture.htlml
3. W. S. Ng, B. C. Ooi, K. Tan, and A. Zhou, "Peerdb: A P2P-based system for distributed data sharing." in ICDE, 2003.
4. "Edos project: Environinent for the development and distribution of open source software," http:/www.edos-pruject.org.
5. S. Abiteboul, I. Manolescu, and N. Preda, "Constructing and querying P2P warehouses of XML resources," in ICDE (demo), 2005.
6. F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica, "Towards a common API for structured P2P overlays." in Proc. of IPTPS, 2003.
7. N. Bruno, N. Koudas, and D. Srivastava, "Holistic twig joins: optimal XML pattern matching." in SIGMOD, 2002.
8. L. Galanis, Y. Wang, S. Jeffery, and D. DeWitt, "Locating data sources in large distributed syste-ms." in VLDB, 2003.
9. A. Bonifati, U. Matrangolo, A. Cuzzocrea, and M. Jain, "XPath lookup queries in P2P networks." in WIDM, 2004.
10. S. Abiteboul, I. Manolescu, N. Polyzotis, N. Preda, and C. Sun, "XML processing in dht networks," http://gemo.futurs.inria.fr/projects/KadoP/ perf.pdf.
11. K. Aberer, A. Datta, M. Hauswirth, and R. Schmidt, "Indexing dataoriented overlay networks." in VLDB, 2005.
12. A. Crainiceanu, P. Linga, A. Machanavajjhala, J. Gehrke, and J. Shanmugasundaram, "P-Ring: An efficient and robust P2P range index structure" in .SIGMOD, 2007.
13. B. Loo, J. Hellerstein, R. Huebsch, S. Shenker, and I. Stoica, "Enhancing P2P file-sharing with an internet-scale query processor," in VLDB, 2004.
14. A. I. T. Rowstron and P. Druschel, "Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage," in SOSP, 2001.
15. P. Krishna and T. Johnson, "Index replication in a distributed B-tree." in COMAD, 1994.
16. M. T. Ozsu and P. Valduriez, Principles ( 'distributed database systeis. Prentice-Hall, 1991.
17. B. Bloom, "Space/time trade-offs in hash coding with allowable errors," Communications ufthe ACM, 1970.
18. A. Y. Halevy, Z. G. Ives, J. Madhavan, P. Mork, D. Suciu, and I. Tatarinov, "The Piazza peer data management system." IEEE Trans. Knowl. Data Eng., vol. 16, no. 7, 2004.
19. P. B. Gibbons, B. Karp, Y. Ke, S. Nath, and S. Seshan, "An architecture for a world-wide sensor web." IEEE Pervasive Computing, vol. 2, no. 4, October-December 2003.
20. J. Li, B. Loo, J. Hellerstein, M. F. Kaashoek, D. Karger, and R. Morris, "On the feasibility of peer-to-peer web indexing and search." in Proc. of IPTPS, 2003.
21. P. Reynolds and A. Vahdat, "Efficient peer-to-peer keyword searching." in Int.'l Middleware Coif, 2003.
22. G. Skobeltsyn, M. Hauswirth, and K. Aberer, "Efficient processing of XPath queries with structured overlay networks." in OTM Conferences (2), 2005.
23. S. M. A. C. Gilbert, Y. Kotidis and M. J. Strauss., "How to summarize the universe: Dynamic imnaintenance of quantiles," in VLDB, 2002.
24. A. Das, J. Gehrke, and M. Riedewald, "Approximation techniques for spatial data," in SIGMOD, 2004.
25. W. Wang, H. Jiang, H. Lu, and J. X. Yu, "Bloom histogram: Path selectivity estimation for xrml data with updates." in VLDB, 2004, pp. 240-251.
26. G. Koloniari and E. Pitoura, "Content-based routing of path queries in peer-to-peer systems." in EDBT, 2004.
27. B Mandhani and D Suciu, "Query caching and view selection for xml databases," in VLDB, 2005.