12 search results - page 1 / 3 » XPath lookup queries in P2P networks |
WIDM
2004
ACM
13 years 9 months ago
2004
ACM
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 exte...
LCN
2008
IEEE
13 years 10 months ago
2008
IEEE
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
EDBT
2009
ACM
13 years 8 months ago
2009
ACM
Many websites with a large user base, e.g., websites of nonprofit organizations, do not have the financial means to install large web-servers or use specialized content distributi...
CIA
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Recent advances in peer to peer (P2P) search algorithms have presented viable structured and unstructured approaches for full-text search. We posit that these existing ap...
CN
2010
13 years 4 months ago
2010
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...