Concurrent maintenance of data systems for telecommunications
The Computer Journal
Lazy replication: exploiting the semantics of distributed services
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A methodology for implementing highly concurrent data structures
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Parallel Processing of large node B-trees
IEEE Transactions on Computers
Maintaining bounded disorder files in multiprocessor multi-disk environments
ICDT '90 Proceedings of the third international conference on database theory on Database theory
LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Lazy updates for distributed search structure
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
An efficient method for distributing search structures
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Multi-version memory: software cache management for concurrent B-trees
SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Snowball: Scalable Storage on Networks of Workstations with Balanced Load
Distributed and Parallel Databases
Managing Statistical Behavior of Large Data Sets in Shared-Nothing Architectures
IEEE Transactions on Parallel and Distributed Systems
Dynamic maintenance of multidimensional range data partitioning for parallel data processing
Proceedings of the 1st ACM international workshop on Data warehousing and OLAP
Towards self-tuning data placement in parallel database systems
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
LH*G: A High-Availability Scalable Distributed Data Structure By Record Grouping
IEEE Transactions on Knowledge and Data Engineering
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Finding Data in the Neighborhood
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
EH* - Extendible Hashing in a Distributed Environment
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Distributed Searching of k-Dimensional Data with Almost Constant Costs
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
An Efficient Dynamic and Distributed Cryptographic Accumulator
ISC '02 Proceedings of the 5th International Conference on Information Security
A Very Efficient Order Preserving Scalable Distributed Data Structure
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Guaranteeing correctness and availability in P2P range indices
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A Scalable P2P Platform for the Knowledge Grid
IEEE Transactions on Knowledge and Data Engineering
On scalability of the similarity search in the world of peers
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Grid-based distributed search structure
Proceedings of the 44th annual Southeast regional conference
Scalability comparison of Peer-to-Peer similarity search structures
Future Generation Computer Systems
Self-tuning management of update-intensive multidimensional data in clusters of workstations
The VLDB Journal — The International Journal on Very Large Data Bases
Incrementally distributed B+ trees: approaches and challenges
Proceedings of the 47th Annual Southeast Regional Conference
ROAR: increasing the flexibility and performance of distributed search
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
DiST: fully decentralized indexing for querying distributed multidimensional datasets
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Analyzing design choices for distributed multidimensional indexing
The Journal of Supercomputing
SkipTree: a scalable range-queryable distributed data structure for multidimensional data
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Distributed and scalable similarity searching in metric spaces
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Shepherdable indexes and persistent search services for mobile users
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 II
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Similarity grid for searching in metric spaces
DELOS'04 Proceedings of the 6th Thematic conference on Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures
Self-star Properties in Complex Information Systems
Hi-index | 0.00 |
Databases are growing steadily, and distributed computer systems are more and more easily available. This provides an opportunity to satisfy the increasingly tighter efficiency requirements by means of distributed data structures. The design and analysis of these structures under efficiency aspects, however, has not yet been studied sufficiently. To our knowledge, a single scalable, distributed data structure has been proposed so far. It is a distributed variant of linear hashing with uncontrolled splits, and, as a consequence, performs efficiently for data distributions that are close to uniform, but not necessarily for others. In addition, it does not support queries that refer to the linear order of keys, such as nearest neighbor or range queries. We propose a distributed search tree that avoids these problems, since it inherits desirable properties from non-distributed trees. Our experiments show that our structure does indeed combine a guarantee for good storage space utilization with high query efficiency. Nevertheless, we feel that further research in the area of scalable, distributed data structures is dearly needed; it should eventually lead to a body of knowledge that is comparable with the non-distributed, classical data structures field.