ADST: An order preserving scalable distributed data structure with constant access costs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2234, Issue , 2001, Pages 211-222

  Di Pasquale, Adriano ^a   Nardelli, Enrico ^a,b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b CNR   (Italy)

Author keywords

Message passing environment; Multi dimensional search; Scalable distributed data structure

Indexed keywords

COMPUTATION THEORY; DATA STRUCTURES; HIGH SPEED NETWORKS; MESSAGE PASSING;

DISTRIBUTED COMPUTING ENVIRONMENT; DISTRIBUTED DATA STRUCTURES; FAST RESPONSE TIME; HASHING TECHNIQUES; HIGH AVAILABILITY; HIGH RELIABILITY; MULTI DIMENSIONAL; PERFORMANCE REQUIREMENTS;

QUERY PROCESSING;

EID: 84943236947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45627-9_18     Document Type: Conference Paper

References (16)

1. P. Bozanis, Y. Manolopoulos: DSL: Accomodating Skip Lists in the SDDS Model, Workshop on Distributed Data and Structures (WDAS 2000), L’Aquila, June 2000.
2. Y. Breitbart, R. Vingralek: Addressing and Balancing Issues in Distributed B+- Trees, 1st Workshop on Distributed Data and Structures (WDAS’98), 1998.
3. R. Devine: Design and implementation of DDH: a distributed dynamic hashing algorithm, 4th Int.Conf.on Foundations of Data Organization and Algorithms (FODO), Chicago, 1993.
4. A. Di Pasquale, E. Nardelli: Fully Dynamic Balanced and Distributed Search Trees with Logarithmic Costs, Workshop on Distributed Data and Structures (WDAS’99), Princeton, NJ, May 1999.
5. A. Di Pasquale, E. Nardelli: Distributed searching of k-dimensional data with almost constant costs, ADBIS 2000, Prague, September 2000.
6. A. Di Pasquale, E. Nardelli: ADST: Aggregation in Distributed Search Trees, Technical Report 1/2001, University of L’Aquila, February 2001.
7. A. Di Pasquale, E. Nardelli: A Very Efficient Order Preserving Scalable Distributed Data Structure, accepted for pubblication at DEXA 2001 Conference.
8. B. Kroll, P. Widmayer: Distributing a search tree among a growing number of processor, in ACM SIGMOD Int.Conf.on Management of Data, pp 265-276 Minneapolis, MN, 1994.
9. W. Litwin, M.A. Neimat, D.A. Schneider: LH* - Linear hashing for distributed files, ACM SIGMOD Int.Conf.on Management of Data, Washington, D. C., 1993.
10. W. Litwin, M.A. Neimat, D.A. Schneider: RP* - A family of order-preserving scalable distributed data structure, in 20th Conf.on Very Large Data Bases, Santiago, Chile, 1994.
11. W. Litwin, M.A. Neimat, D.A. Schneider: k-RP∗ s - A High Performance Multi- Attribute Scalable Distributed Data Structure, in 4th International Conference on Parallel and Distributed Information System, December 1996.
12. W. Litwin, M.A. Neimat, D.A. Schneider: LH* - A Scalable Distributed Data Structure, ACM Trans.on Database Systems, 21(4), 1996.
13. W. Litwin, T.J.E. Schwarz, S.J.: LH*RS: a High-availability Scalable Distributed Data Structure using Reed Solomon Codes, ACM SIGMOD Int.Conf.on Management of Data, 1999.
14. E. Nardelli, F. Barillari, M. Pepe: Distributed Searching of Multi-Dimensional Data: a Performance Evaluation Study, Journal of Parallel and Distributed Computation (JPDC), 49, 1998.
15. R. Vingralek, Y. Breitbart, G. Weikum: Distributed file organization with scalable cost/performance, ACM SIGMOD Int.Conf.on Management of Data, Minneapolis, MN, 1994.
16. R. Vingralek, Y. Breitbart, G. Weikum: SNOWBALL: Scalable Storage on Networks of Workstations with Balanced Load, Distr.and Par. Databases, 6, 2, 1998.