Concentric Hyperspaces and Disk Allocation for Fast Parallel Range Searching.

@inproceedings{DBLP:conf/icde/FerhatosmanogluAA99,
  author    = {Hakan Ferhatosmanoglu and
               Divyakant Agrawal and
               Amr El Abbadi},
  title     = {Concentric Hyperspaces and Disk Allocation for Fast Parallel
               Range Searching},
  booktitle = {Proceedings of the 15th International Conference on Data Engineering,
               23-26 March 1999, Sydney, Austrialia},
  publisher = {IEEE Computer Society},
  year      = {1999},
  pages     = {608-615},
  ee        = {db/conf/icde/FerhatosmanogluAA99.html},
  crossref  = {DBLP:conf/icde/99},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1999 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD DiSC

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/DISC001 or /cdrom

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Online Edition: IEEE Computer Society DL

Printed Edition

References

[1]

Khaled A. S. Abdel-Ghaffar, Amr El Abbadi: Optimal Allocation of Two-Dimensional Data. ICDT 1997: 409-418 BibTeX

[2]

Stefan Berchtold, Christian Böhm, Bernhard Braunmüller, Daniel A. Keim, Hans-Peter Kriegel: Fast Parallel Similarity Search in Multimedia Databases. SIGMOD Conference 1997: 1-12 BibTeX

[3]

Stefan Berchtold, Christian Böhm, Daniel A. Keim, Hans-Peter Kriegel: A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space. PODS 1997: 78-86 BibTeX

[4]

Stefan Berchtold, Christian Böhm, Hans-Peter Kriegel: The Pyramid-Technique: Towards Breaking the Curse of Dimensionality. SIGMOD Conference 1998: 142-153 BibTeX

[5]

Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel: The X-tree : An Index Structure for High-Dimensional Data. VLDB 1996: 28-39 BibTeX

[6]

David Hung-Chang Du, J. S. Sobolewski: Disk Allocation for Cartesian Product Files on Multiple-Disk Systems. ACM Trans. Database Syst. 7(1): 82-101(1982) BibTeX

[7]

Christos Faloutsos, Pravin Bhagwat: Declustering Using Fractals. PDIS 1993: 18-25 BibTeX

[8]

Hakan Ferhatosmanoglu, Divyakant Agrawal, Amr El Abbadi: Concentric Hyperspaces and Disk Allocation for Fast Parallel Range Searching. ICDE 1999: 608-615 BibTeX

[9]

Yu-lung Lo, Kien A. Hua, Honesty C. Young: A General Multidimensional Data Allocation Method for Multicomputer Database Systems. DEXA 1997: 357-366 BibTeX

[10]

Myoung-Ho Kim, Sakti Pramanik: Optimal File Distribution For Partial Match Retrieval. SIGMOD Conference 1988: 173-182 BibTeX

[11]

Sunil Prabhakar, Khaled A. S. Abdel-Ghaffar, Divyakant Agrawal, Amr El Abbadi: Cyclic Allocation of Two-Dimensional Data. ICDE 1998: 94-101 BibTeX

[12]

Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi: Efficient Disk Allocation for Fast Similarity Searching. SPAA 1998: 78-87 BibTeX

[13]

...

Referenced by

1. Rakesh K. Sinha, Randeep Bhatia, Chung-Min Chen: Asymptotically Optimal Declustering Schemes for Range Queries. ICDT 2001: 144-158
2. Randeep Bhatia, Rakesh K. Sinha, Chung-Min Chen: Hierarchical Declustering Schemes for Range Queries. EDBT 2000: 525-537
3. Hakan Ferhatosmanoglu, Divyakant Agrawal, Amr El Abbadi: Concentric Hyperspaces and Disk Allocation for Fast Parallel Range Searching. ICDE 1999: 608-615