The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Principles of distributed database systems (2nd ed.)
Principles of distributed database systems (2nd ed.)
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Distributed query evaluation on semistructured data
ACM Transactions on Database Systems (TODS)
Efficient URL caching for world wide web crawling
WWW '03 Proceedings of the 12th international conference on World Wide Web
Mapping data in peer-to-peer systems: semantics and algorithmic issues
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Dynamic XML documents with distribution and replication
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
FleXPath: flexible structure and full-text querying for XML
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient query reformulation in peer data management systems
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Querying peer-to-peer networks using P-trees
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Querying the internet with PIER
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Locating data sources in large distributed systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Enhancing P2P file-sharing with an internet-scale query processor
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
XPeer: a self-organizing XML P2P database system
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Peer-to-peer management of XML data: issues and research challenges
ACM SIGMOD Record
Storing and retrieving XPath fragments in structured P2P networks
Data & Knowledge Engineering - Special issue: WIDM 2004
Net-χ: unified data-centric internet services
NETB'07 Proceedings of the 3rd USENIX international workshop on Networking meets databases
Xml data dissemination using automata on top of structured overlay networks
Proceedings of the 17th international conference on World Wide Web
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Integrating and querying distributed XML data via XLink
Information Systems
Data mining-based fragmentation of XML data warehouses
Proceedings of the ACM 11th international workshop on Data warehousing and OLAP
Plexus: a scalable peer-to-peer protocol enabling efficient subset search
IEEE/ACM Transactions on Networking (TON)
Keyword search considering user's preference in P2P networks
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Enhancing XML data warehouse query performance by fragmentation
Proceedings of the 2009 ACM symposium on Applied Computing
Utilizing XML Clustering for Efficient XML Data Management on P2P Networks
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
Fragmenting very large XML data warehouses via K-means clustering algorithm
International Journal of Business Intelligence and Data Mining
Retrieving arbitrary XML fragments from structured peer-to-peer networks
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
XML query routing in structured P2P systems
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Approximate XML query answers in DHT-based P2P networks
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
Selectivity-based XML query processing in structured peer-to-peer networks
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Efficient processing of XPath queries with structured overlay networks
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II
Efficiently processing XML queries over fragmented repositories with partix
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
FoXtrot: Distributed structural and value XML filtering
ACM Transactions on the Web (TWEB)
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the extensions needed to deal with XML data and XPath queries. A single peer can hold a whole document or a partial/complete fragment of the latter. Each XML fragment/document is identified by a distinct path expression, which is encoded in a distributed hash table. Our framework differs from content-based routing mechanisms, biased towards finding the most relevant peers holding the data. We perform fragments placement and enable fragments lookup by solely exploiting few path expressions stored on each peer. By taking advantage of quasi-zero replication of global catalogs, our system supports fast full and partial XPath querying. To this purpose, we have extended the Chord simulator and performed an experimental evaluation of our approach.