Efficient disk allocation for fast similarity searching

No abstract is available for this paper.

• Publication year

  1998

• Venue

  ACM Symposium on Parallelism in Algorithms and Architectures

• Publication date

  1998-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/277651.277674
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The X-tree : An Index Structure for High-Dimensional Data

  2001cited by this paper
• Cyclic allocation of two-dimensional data

  1998cited by this paper
• Optimal Allocation of Two-Dimensional Data

  1997cited by this paper
• Fast parallel similarity search in multimedia databases

  1997cited by this paper
• Scalable access within the context of digital libraries

  1997cited by this paper
• cient Disk Allocation for Fast Similarity Searching

  1997cited by this paper
• Texture Features for Browsing and Retrieval of Image Data

  1996cited by this paper
• Similarity indexing with the SS-tree

  1996cited by this paper
• A trace-driven comparison of algorithms for parallel prefetching and caching

  1996cited by this paper
• The Scotch parallel storage systems

  1995cited by this paper
• Generalized Search Trees for Database Systems

  1995cited by this paper
• Eecient Similarity S E a R C H in Sequence Databases

  1993cited by this paper
• QBIC project: querying images by content, using color, texture, and shape

  1993cited by this paper
• Efficient Similarity Search In Sequence Databases

  1993cited by this paper
• Declustering using fractals

  1993cited by this paper
• Optimal disk allocation for partial match queries

  1993cited by this paper
• A performance analysis of alternative multi-attribute declustering strategies

  1992cited by this paper
• CMD: A Multidimensional Declustering Method for Parallel Data Systems

  1992cited by this paper
• A retrieval technique for similar shapes

  1991cited by this paper
• Segment indexes: dynamic indexing techniques for multi-dimensional interval data

  1991cited by this paper
• The R*-tree: an efficient and robust access method for points and rectangles

  1990cited by this paper
• A multiuser performance analysis of alternative declustering strategies

  1990cited by this paper
• The hB-tree: a multiattribute indexing method with good guaranteed performance

  1990cited by this paper
• Declustering using error correcting codes

  1989cited by this paper
• The design of the cell tree: an object-oriented index structure for geometric databases

  1989cited by this paper
• Optimal file distribution for partial match retrieval

  1988cited by this paper
• R-trees: a dynamic index structure for spatial searching

  1984cited by this paper
• Disk allocation for Cartesian product files on multiple-disk systems

  1982cited by this paper
• An application of number theory to the organization of raster-graphics memory

  1982cited by this paper

• A meta-indexing method for fast probably approximately correct nearest neighbor searches

  2022cites this paper
• AQWA: Adaptive Query-Workload-Aware Partitioning of Big Spatial Data

  2015cites this paper
• Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays

  2013cites this paper
• Equivalent Disk Allocations-Supplementary File

  2010cites this paper
• Divide-and-conquer scheme for strictly optimal retrieval of range queries

  2009cites this paper
• Multi-Site Retrieval of Declustered Data

  2008cites this paper
• Searching in Metric Spaces

  2008cites this paper
• Equivalent Disk Allocations

  2007cites this paper
• Analysis and Comparison of Replicated Declustering Schemes

  2007cites this paper
• Threshold-based declustering

  2007cites this paper
• Data space mapping for efficient I/O in large multi-dimensional databases

  2007cites this paper
• Efficient parallel processing of range queries through replicated declustering

  2006cites this paper
• Efficient retrieval of replicated data

  2006cites this paper
• Optimal Data-Space Partitioning of Spatial Data for Parallel I/O

  2005cites this paper
• Similarity measures for complex data

  2005cites this paper
• Replicated declustering of spatial data

  2004cites this paper
• Replicated Declustering of Spatial Data

  2004cites this paper
• Optimal Data-Space Partitioning of Spatial Data for Parallel I/O

  2004cites this paper
• Disk Allocation for Fast Range and Nearest-Neighbor Queries

  2003cites this paper
• Optimal Parallel I/O for Range Queries through Replication

  2002cites this paper
• Searching in metric spaces

  2001cites this paper
• Optimal Partitioning for Efficient I/O in Spatial Databases

  2001cites this paper
• Searching in Metric Spaces

  2001cites this paper
• Optimal Partitioning for Spatial

  2000cites this paper
• (Almost) optimal parallel block access to range queries

  2000cites this paper
• Concentric hyperspaces and disk allocation for fast parallel range searching

  1999influential citation
• CIRCULAR DATA-SPACE PARTITIONING FOR SIMILARITY QUERIES AND PARALLEL DISK ALLOCATION

  1999cites this paper
• Clustering declustered data for efficient retrieval

  1999cites this paper
• Data declustering for efficient range and similarity searching

  1998cites this paper
• Efficient retrieval of multidimensional datasets through parallel I/O

  1998cites this paper
• cient Disk Allocation for Fast Similarity Searching

  1997cites this paper
• Non-commercial Research and Educational Use including without Limitation Use in Instruction at Your Institution, Sending It to Specific Colleagues That You Know, and Providing a Copy to Your Institution's Administrator. All Other Uses, Reproduction and Distribution, including without Limitation Comm

  year unknowncites this paper