Clustering declustered data for efficient retrieval

No abstract is available for this paper.

• Publication year

  1999

• Venue

  International Conference on Information and Knowledge Management

• Publication date

  1999-11-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/319950.320026
• 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
• CIRCULAR DATA-SPACE PARTITIONING FOR SIMILARITY QUERIES AND PARALLEL DISK ALLOCATION

  1999cited by this paper
• Concentric hyperspaces and disk allocation for fast parallel range searching

  1999cited by this paper
• Efficient disk allocation for fast similarity searching

  1998cited by this paper
• Multidimensional access methods

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

  1998cited by this paper
• Active disks: programming model, algorithms and evaluation

  1998cited by this paper
• The Asilomar report on database research

  1998cited by this paper
• The pyramid-technique: towards breaking the curse of dimensionality

  1998cited by this paper
• A General Multidimensional Data Allocation Method for Multicomputer Database Systems

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

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

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

  1995cited by this paper
• Declustering using fractals

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

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

  1990cited by this paper
• The Design and Analysis of Spatial Data Structures

  1989cited 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

• Data space mapping for efficient I/O in large multi-dimensional databases

  2007cites this paper
• Physical Database Design: The Database Professional's Guide to Exploiting Indexes, Views, Storage, and More

  2007cites this paper
• Research issues in automatic database clustering

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

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

  2004influential citation
• Serving queries to multi-resolution datasets on disk-based storage clusters

  2004cites this paper
• Optimal parallel I/O using replication

  2002cites this paper
• Eecient Processing of Conical Queries

  2001cites this paper
• Approximate nearest neighbor searching in multimedia databases

  2001cites this paper
• Efficient processing of conical queries

  2001cites this paper
• Constrained Nearest Neighbor Queries

  2001cites this paper
• Introductionto CMS from a CSviewpoint KoenHoltman , 21 Nov 2000 1 Introduction

  2001cites this paper
• Prototyping of CMS storage management

  2000cites 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