Hakan Ferhatosmanoglu, Divyakant Agrawal, Amr El Abbadi  Home/Search
Context Related
| ucsb.edu/~hakan/publication...CIKM99.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsb.edu/~hakan/publicati...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Modern databases increasingly integrate new kinds of information, such as multimedia information in the form of image, video, and audio data. Both the dimensionality and the amount of data that need to be processed is increasing rapidly, increasing the demand for the ecient retrieval of large amounts of multi-dimensional data. Declustering techniques for multi-disk architectures have been effectively used for storage. In this paper, we first establish that besides exploiting the parallelism, a... (Update)
Context of citations to this paper: More
.... Tree [12] There are also techniques that are proposed to reduce the size of the retrieved set in multiple disk architectures [15, 18, 19]. All these index structures focus mainly on finding the exact result for a query. Therefore, a retrieved set of size s includes the query...
.... Tree [12] There are also techniques that are proposed to reduce the size of the retrieved set in multiple disk architectures [16, 19, 20]. All these index structures focus mainly on finding the exact result for a query. Therefore, a retrieved set of size s includes the query...
Cited by: More
Efficient Processing of Conical Queries - Ferhatosmanoglu, Agrawal, Abbadi (2001) (Correct)
Approximate Nearest Neighbor Searching in Multimedia.. - Ferhatosmanoglu.. (2000) (Correct)
Similar documents (at the sentence level):
71.7%: Clustering Declustered Data for Efficient Retrieval - Ferhatosmanoglu (1999) (Correct)
Active bibliography (related documents): More All
0.7: Optimal Parallel I/O Using Replication - Tosun, Ferhatosmanoglu (1997) (Correct)
0.5: Multidimensional Declustering Schemes using Golden Ratio.. - Chen, Bhatia, Sinha (Correct)
0.5: Optimal Partitioning for Efficient I/O in Spatial Databases - Ferhatosmanoglu, Agrawal, .. (Correct)
Similar documents based on text: More All
0.4: Declustering two-dimensional datasets over MEMS-based Storage - Hailing Yu Divyakant (2003) (Correct)
0.4: Synchronization in Nested Transactions - Resende (Correct)
0.3: Concentric Hyperspaces and Disk Allocation for Fast.. - Ferhatosmanoglu.. (1999) (Correct)
Related documents from co-citation: More All
3: Scalable access within the context of digital libraries - Cheng, Dolin et al. - 1997
3: The Asilomar Report on Database Research (context) - Bernstein - 1998
3: tree: an efficient and Robust Access Method for Points and Rectangles (context) - Beckmann, Kriegel et al. - 1990
BibTeX entry: (Update)
H. Ferhatosmanoglu, D. Agrawal, and A. El Abbadi. Clustering declustered data for efficient retrieval. In Proc. Conf. on Information and Knowledge Management, pages 343--350, Kansas City, Missouri, November 1999. http://citeseer.ist.psu.edu/article/ferhatosmanoglu99clustering.html More
@techreport{ ferhatosmanoglu99clustering,
author = "Hakan Ferhatosmanoglu and Divyakant Agrawal and Amr El Abbadi",
title = "Clustering Declustered Data for Efficient Retrieval",
number = "TRCS99-22",
month = "30,",
year = "1999",
url = "citeseer.ist.psu.edu/article/ferhatosmanoglu99clustering.html" }
Citations (may not include all citations):765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
262 Multidimensional access methods - Gaede, Gunther - 1998
162 Similarity indexing with the SS-tree (context) - White, Jain - 1996
117 Generalized search trees for database systems - Hellerstein, Naughton et al. - 1995
97 The TV-tree: An index structure for high-dimensional data - Lin, Jagadish et al. - 1995
88 The hb-tree: A multiattribute indexing method with good guar.. (context) - Lomet, Salzberg - 1990
86 The Pyramid-Technique: Towards breaking the curse of dimensi.. (context) - Berchtold, Bohm et al. - 1998
78 The Xtree: An index structure for high-dimensional data - Berchtold, Keim et al. - 1996
75 The asilomar report on database research (context) - Bernstein, Brodie et al. - 1998
70 Active disks: Programming model (context) - Acharya, Uysal et al. - 1998
61 Fast parallel similarity search in multimedia databases (context) - Berchtold, Bohm et al. - 1997
57 Declustering using fractals - Faloutsos, Bhagwat - 1993
20 Cyclic allocation of two-dimensional data - Prabhakar, Abdel-Gha et al. - 1998
13 Concentric hyperspaces and disk allocation for fast parallel.. - Ferhatosmanoglu, Agrawal et al. - 1999
12 The Design and Analysis of Spatial Structures (context) - Samet - 1989
10 Optimal disk allocation for partial match queries (context) - Abdel-Gha, Abbadi - 1993
9 A general multidimensional data allocation method for multic.. (context) - Hua, Young - 1997
6 Circular dataspace partitioning for similarity queries and p.. - Egecioglu, Ferhatosmanoglu - 1999
6 Disk allocation for cartesian product les on multiple-disk s.. (context) - Du, Sobolewski - 1982
4 Clustering declustered data for ecient retrieval - Ferhatosmanoglu, Agrawal et al. - 1999
1 cient disk allocation for fast similarity searching (context) - Prabhakar, Agrawal et al. - 1998
Documents on the same site (http://www.cs.ucsb.edu/~hakan/publications/index.html): More
Dynamic Dimensionality Reduction and Similarity.. - Egecioglu.. (1999) (Correct)
Circular Data-Space Partitioning For Similarity Queries .. - Egecioglu.. (1999) (Correct)
Concentric Hyperspaces and Disk Allocation for Fast.. - Ferhatosmanoglu.. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC