ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs

@inproceedings{Pasquale2001ADSTAO,
  title={ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs},
  author={Adriano Di Pasquale and Enrico Nardelli},
  booktitle={SOFSEM},
  year={2001}
}
Scalable Distributed Data Structures (SDDS) are access methods specifically designed to satisfy the high performance requirements of a distributed computing environment made up by a collection of computers connected through a high speed network. In this paper we propose an order preserving SDDS with a worst-case constant cost for exact-search queries and a worst-case logarithmic cost for update queries. Since our technique preserves the ordering between keys, it is also able to answer to range… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 14 references

LH* - A Scalable, Distributed Data Structure

ACM Trans. Database Syst. • 1996
View 6 Excerpts
Highly Influenced

ADST: Aggregation in Distributed Search Trees

A.Di Pasquale, E. Nardelli
Technical Report 1/2001, • 2001
View 1 Excerpt

Widmayer : Distributing a search tree among a growing number of processor

P. B. Kröll
A Very Efficient Order Preserving Scalable Distributed Data Structure , accepted for pubblication at DEXA • 2001

Similar Papers

Loading similar papers…