TL;DRAbstract
Many emerging applications that use XML are distributed, usually over the Internet or over large Peer-to-Peer (P2P) networks. A fundamental problem of XML query processing in these systems is how to locate the data relevant to the queries so that only useful data are involved in query evaluation. In this paper, we address this problem within the context of structured P2P networks, and propose a novel data locating mechanism for query shipping systems. Our approach follows the multi-hop routing approach and encodes the hierarchical information of the XML data into the overlay network, so that routing keys can be hierarchical XML path expressions. We also propose a decentralized data locating algorithm that does not employ a centralized catalog but also avoids flooding the network with XML queries. We report comprehensive experiments to demonstrate the scalability and effectiveness of the data locating mechanism. 1
Chat with Paper
AI Agents for this Paper
Many emerging applications that use XML are distributed, usually over the Internet or over large Peer-to-Peer (P2P) networks. A fundamental problem of XML query processing in these systems is how to locate the data relevant to the queries so that only useful data are involved in query evaluation. In this paper, we address this problem within the context of structured P2P networks, and propose a novel data locating mechanism for query shipping systems. Our approach follows the multi-hop routing approach and encodes the hierarchical information of the XML data into the overlay network, so that routing keys can be hierarchical XML path expressions. We also propose a decentralized data locating algorithm that does not employ a centralized catalog but also avoids flooding the network with XML queries. We report comprehensive experiments to demonstrate the scalability and effectiveness of the data locating mechanism. 1
Keywords
Chat
Click to start Chat