Algorithms in C
Graphics gems IV
Distributing a search tree among a growing number of processors
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Dissemination of collection wide information in a distributed information retrieval system
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Archival storage for digital libraries
Proceedings of the third ACM conference on Digital libraries
Building a distributed full-text index for the Web
Proceedings of the 10th international conference on World Wide Web
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
The point in polygon problem for arbitrary polygons
Computational Geometry: Theory and Applications
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Distributed Data-Balanced Dictionary Based on the B-Link Tree
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Skip Lists: A Probabilistic Alternative to Balanced Trees
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Concurrency and recovery for index trees
The VLDB Journal — The International Journal on Very Large Data Bases
A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Applications
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Methodologies for Distributed Information Retrieval
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Visage: a user interface environment for exploring information
INFOVIS '96 Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96)
VisageWeb: Visualizing WWW Data in Visage
INFOVIS '99 Proceedings of the 1999 IEEE Symposium on Information Visualization
Replication Control in Distributed B-Trees
Replication Control in Distributed B-Trees
The Priority R-tree: a practically efficient and worst-case optimal R-tree
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Exploiting epidemic data dissemination for consistent lookup operations in mobile applications
ACM SIGMOBILE Mobile Computing and Communications Review
ACM Computing Surveys (CSUR)
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Managing distributed collaboration in a peer-to-peer network
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Managing distributed collaboration in a peer-to-peer network
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
| Hi-index | 0.00 |
We describe a range of designs for supporting rich search queries in a peer-to-peer network Our implementation is based upon uniquely identified data objects which are replicated upon request by agents called Shepherds Several abstract data structures are built upon this framework, supporting dataset management, lexical search, and distributed GIS interfaces in an application called the Geobrowser Our results demonstrate that it is possible to layer higher-level data structures upon a basic peer-to-peer transport and replication layer When users perform a given query, parts of the index as well as the query results themselves are shepherded to the user's local venue A natural benefit of this approach is that mobile users can repeat previous searches if they become disconnected from the rest of the network Some of the data structures that prove to be successful are peer-to-peer adaptations of traditional indexing structures We review some of the properties that lead to successful designs in this domain, giving examples of deployed systems in the Geobrowser.