Results 11 - 20
of
2,664
Index Structures for Path Expressions
, 1997
"... In recent years there has been an increased interest in managing data which does not conform to traditional data models, like the relational or object oriented model. The reasons for this non-conformance are diverse. One one hand, data may not conform to such models at the physical level: it may be ..."
Abstract
-
Cited by 333 (7 self)
- Add to MetaCart
systems support indexes for translating attribute values into tuple ids (e.g. B-trees or hash tables). In object-oriented databases, path queries replace the simpler associative queries. Several data structures have been proposed for answering path queries e ciently: e.g., access support relations 14
Democratizing content publication with Coral
- IN NSDI
, 2004
"... CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broadband Internet connection. Volunteer sites that run CoralCDN automatically replicate content as a side effect of users acc ..."
Abstract
-
Cited by 314 (21 self)
- Add to MetaCart
's key goals is to avoid creating hot spots that might dissuade volunteers and hurt performance. It achieves this through Coral, a latency-optimized hierarchical indexing infrastructure based on a novel abstraction called a distributed sloppy hash table, or DSHT.
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
, 1997
"... Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use of high-dimensional features is critical, due to the improved level of discrimination they can provide. Unfortunately, f ..."
Abstract
-
Cited by 311 (12 self)
- Add to MetaCart
, finding the nearest neighbour to a query point rapidly becomes inefficient as the dimensionality of the feature space increases. Past indexing methods have used hash tables for hypothesis recovery, but only in low-dimensional situations. In this paper, we show that a new variant of the k-d tree search
Skip Graphs
- Proc. of the 14th Annual ACMSIAM Symp. on Discrete Algorithms
, 2003
"... Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where resources are stored in separate nodes that may fail at any time. They are designed for use in searching peer-to-peer systems, and by providin ..."
Abstract
-
Cited by 306 (9 self)
- Add to MetaCart
, and by providing the ability to perform queries based on key ordering, they improve on existing search tools that provide only hash table functionality. Unlike skip lists or other tree data structures, skip graphs are highly resilient, tolerating a large fraction of failed nodes without losing connectivity
Symphony: Distributed Hashing in a Small World
- IN PROCEEDINGS OF THE 4TH USENIX SYMPOSIUM ON INTERNET TECHNOLOGIES AND SYSTEMS
, 2003
"... We present Symphony, a novel protocol for maintaining distributed hash tables in a wide area network. The key idea is to arrange all participants along a ring and equip them with long distance contacts drawn from a family of harmonic distributions. Through simulation, we demonstrate that our constr ..."
Abstract
-
Cited by 211 (13 self)
- Add to MetaCart
We present Symphony, a novel protocol for maintaining distributed hash tables in a wide area network. The key idea is to arrange all participants along a ring and equip them with long distance contacts drawn from a family of harmonic distributions. Through simulation, we demonstrate that our
Ivy: A Read/Write Peer-to-Peer File System
, 2002
"... Ivy is a multi-user read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to fully trust either the underlying peer-to-peer storage system or the other users of the file system.
An Ivy file system con ..."
Abstract
-
Cited by 298 (12 self)
- Add to MetaCart
consists solely of a set of logs, one log per participant. Ivy stores its logs in the DHash distributed hash table. Each participant finds data by consulting all logs, but performs modifications by appending only to its own log. This arrangement allows Ivy to maintain meta-data consistency without locking
Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems
, 2003
"... Locating content in decentralized peer-to-peer systems is a challenging problem. Gnutella, a popular file-sharing application, relies on flooding queries to all peers. Although flooding is simple and robust, it is not scalable. In this paper, we explore how to retain the simplicity of Gnutella, whil ..."
Abstract
-
Cited by 290 (2 self)
- Add to MetaCart
competitive solution. In addition, shortcuts are modular and can be used to improve the performance of other content location mechanisms including distributed hash table schemes.
UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance
"... Abstract. Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These events dissemination allows each node in the peer-to-peer network maintains accurate routing tables with complete ..."
Abstract
- Add to MetaCart
Abstract. Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These events dissemination allows each node in the peer-to-peer network maintains accurate routing tables
Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table
- Mobile Networks and Applications
, 2003
"... Making effective use of the vast amounts of data gathered by large-scale sensor networks (sensornets) will require scalable, self-organizing, and energy-efficient data dissemination algorithms. For sensornets, where the content of the data is more important than the identity of the node that gathers ..."
Abstract
-
Cited by 167 (2 self)
- Add to MetaCart
by the name associated with the sensed data. In this paper, we first define DCS and predict analytically where it outperforms other data dissemination approaches. We then describe GHT, a Geographic Hash Table system for DCS on sensornets. GHT hashes keys into geographic coordinates, and stores a key
Simple Load Balancing for Distributed Hash Tables
, 2002
"... Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We argu ..."
Abstract
-
Cited by 135 (1 self)
- Add to MetaCart
Distributed hash tables have recently become a useful building block for a variety of distributed applications. However, current schemes based upon consistent hashing require both considerable implementation complexity and substantial storage overhead to achieve desired load balancing goals. We
Results 11 - 20
of
2,664