Distributed searching of k-dimensional data with almost constant costs

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

Volumn 1884, Issue , 2000, Pages 239-250

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

^a UNIVERSITY OF L'AQUILA   (Italy)

^b CNR   (Italy)

Author keywords

Distributed data structure; Message passing environment; Multi dimensional search

Indexed keywords

COSTS; DATA STRUCTURES; DATABASE SYSTEMS; INFORMATION SYSTEMS; MESSAGE PASSING;

AMORTIZED ANALYSIS; DISTRIBUTED DATA STRUCTURES; DISTRIBUTED STRUCTURES; MULTI DIMENSIONAL; REAL APPLICATIONS; SCHNEIDER; WORST-CASE ANALYSIS;

COST BENEFIT ANALYSIS;

EID: 84949455435     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44472-6_19     Document Type: Conference Paper

References (15)

1. 2 N) Time, Technical Report 146, Dipartimento di Matematica Pura ed Applicata, Universita’ di L’Aquila, July 1997, accepted for publication on the Journal of Parallel and Distributed Computation.
2. Y. Breitbart, R. Vingralek: Addressing and Balancing Issues in Distributed B+-Trees, 1st Workshop on Distributed Data and Structures (WDAS’98), 1998.
3. Chorochronos: A Research Network for Spatiotemporal Database Systems. SIGMOD Record 28(3): 12-21 (1999).
4. A. Di Pasquale, E. Nardelli: Balanced and Distributed Search Trees, Workshop on Distributed Data and Structures (WDAS’99), Princeton, NJ, May 1999.
5. A. Di Pasquale, E. Nardelli: Design and analysis of distributed searching of k-dimensional data with almost constant costs, Tech. Rep. 00/14, Dept. of Pure and Applied Mathematics, Univ. of L’Aquila, May 2000.
6. B.A. Galler, M.J. Fisher: An improved equivalence algorithm, Commun. ACM 7, 5(1964), 301-303.
7. B. Kröll, 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.
8. 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.
9. 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.
10. E. Nardelli: Distribuited k-d trees, in XVI Int. Conf. of the Chilean Computer Science Society (SCCC’96), Valdivia, Chile, November 1996.
11. E. Nardelli, F. Barillari and M. Pepe: Design issues in distributed searching of multi-dimensional data, 3rd International Symposium on Programming and Systems (ISPS’97), Algiers, Algeria, April 1997.
12. E. Nardelli, F. Barillari, M. Pepe: Distributed Searching of Multi-Dimensional Data: a Performance Evaluation Study, Journal of Parallel and Distributed Computation, 49, 1998.
13. R.E. Tarjan: Efficiency of a good but non linear set union algorithm, J. Assoc. Comput. Mach., 22(1975), pp. 215-225.
14. T. Tzouramanis, M. Vassilakopoulos, Y. Manolopoulos: Processing of Spatio-Temporal Queries in Image Databases. ADBIS 1999, pp. 85-97.
15. J. Van Leeuwen, R.E. Tarjan: Worst-case analysis of set union algorithms, J. Assoc. Comput. Mach., 31(1984), pp. 245-281.