On effective multi-dimensional indexing for strings

No abstract is available for this paper.

• Publication year

  2000

• Venue

  ACM SIGMOD Conference

• Publication date

  2000-05-16

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/342009.335434
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Querying network directories

  1999cited by this paper
• Multi-Dimensional Substring Selectivity Estimation

  1999cited by this paper
• The string B-tree: a new data structure for string search in external memory and its applications

  1999influential reference
• The art of computer programming, volume 3: (2nd ed.) sorting and searching

  1998cited by this paper
• Multidimensional access methods

  1998influential reference
• On sorting strings in external memory (extended abstract)

  1997cited by this paper
• Fast string searching in secondary storage: theoretical developments and experimental results

  1996cited by this paper
• Filter Trees for Managing Spatial Data over a Range of Size Granularities

  1996cited by this paper
• A fully-dynamic data structure for external substring search

  1995cited by this paper
• Suffix arrays: a new method for on-line string searches

  1993cited by this paper
• New Indices for Text: Pat Trees and Pat Arrays

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

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

  1989cited by this paper
• The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

  1987cited by this paper
• The R+ - tree : A Dynamic Index for Multi - dimensional Data

  1987cited by this paper
• Direct spatial search on pictorial databases using packed R-trees

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

  1984influential reference
• The K-D-B-tree: a search structure for large multidimensional dynamic indexes

  1981cited by this paper
• Prefix B-trees

  1977cited by this paper
• A Space-Economical Suffix Tree Construction Algorithm

  1976cited by this paper
• The Art of Computer Programming, Volume 3, Sorting and Searching

  1974cited by this paper
• PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

  1968cited by this paper

• Autocompletion for Prefix-Abbreviated Input

  2019cites this paper
• Path indexing for efficient path query processing in graph databases

  2015cites this paper
• Research on Multi-Attribute Sequence Query Processing Techniques over Data Streams

  2014cites this paper
• Research on Sequence Query Processing Techniques over Data Streams

  2013cites this paper
• Efficient evaluation of partially-dimensional range queries in large OLAP datasets

  2011cites this paper
• Speeding up index construction with GPU for DNA data sequences

  2011cites this paper
• String-Based Semantic Web Data Management Using Ternary B-Trees

  2010cites this paper
• Keyword Search in Spatial Databases: Towards Searching by Document

  2009cites this paper
• Real-valued feature indexing for music databases

  2009cites this paper
• Approximate Searching for Music Data in Real-Valued Feature Indexing

  2009cites this paper
• Management of biological sequences using suffix trees

  2009cites this paper
• iVA-File: Efficiently Indexing Sparse Wide Tables in Community Systems

  2009cites this paper
• Research and Application of XML Documents Query Based on Weight Cost

  2009influential citation
• Efficient Memory Saving Scheme of Multi-Feature Indexing for Music Databases

  2009cites this paper
• Scalable multi-feature index structure for music databases

  2009cites this paper
• On k-d Range Search with Patricia Tries

  2008cites this paper
• Efficient and Scalable Indexing Techniques for Biological Sequence Data

  2007cites this paper
• Optimizing a Rete-based Inference Engine using a Hybrid Heuristic and Pyramid based Indexes on Ontological Data

  2007cites this paper
• On k-d Range Search With Large k

  2006cites this paper
• Discovering Consensus Patterns in Biological Databases

  2006cites this paper
• Clustering Large Scale of XML Documents

  2006cites this paper
• Structure-aware XML Object Identification

  2006cites this paper
• Cleansing Databases of Misspelled Proper Nouns

  2006cites this paper
• The PKD-tree for Orthogonal d-Dimensional Range Search

  2006cites this paper
• Adapting the Pyramid Technique for Indexing Ontological Data

  2006cites this paper
• Kural Örüntülerinin Düzenlenmesi ve Ontolojik Verinin İndekslenmesi ile Rete Tabanlı Bir Çıkarsama Motorunun Eniyilenmesi

  2006cites this paper
• On the Use of Wavelet Decomposition for String Classification

  2005cites this paper
• A Hybrid Clustering Criterion for R*-Tree on Business Data

  2005cites this paper
• The 2dr-tree: a 2-dimensional spatial access method

  2005cites this paper
• Indexing Mixed Types for Approximate Retrieval

  2005cites this paper
• Estimating the Number of Substring Matches in Long String Databases

  2005cites this paper
• A compressed accessibility map for XML

  2004cites this paper
• BASS: approximate search on large string databases

  2004cites this paper
• k-d Range Search with Binary Patricia Tries

  2004influential citation
• Generalized substring selectivity estimation

  2003cites this paper
• Modeling and implementing multidimensional hierarchically structured data for data warehouses in relational database management systems and the implementation into transbase

  2003cites this paper
• Two-dimensional substring indexing

  2003cites this paper
• Multi-feature indexing for music data

  2003cites this paper
• An Interactive Search Technique for String Databases

  2003cites this paper
• Approximate string matching in DNA sequences

  2003cites this paper
• Similarity Metric for XML Documents

  2003cites this paper
• Indexing weighted-sequences in large databases

  2003cites this paper
• Query relaxation for xml model

  2002cites this paper
• Database indexing for large DNA and protein sequence collections

  2002cites this paper
• Indexing and selection of data items in huge data sets by constructing and accessing tag collections

  2002cites this paper
• A compact B-tree

  2002cites this paper
• An index structure for pattern similarity searching in DNA microarray data

  2002cites this paper
• Accelerating Substring Searching: Breaking the I/O Barrier

  2002cites this paper
• The numeric indexing for music data

  2002cites this paper
• On effective classification of strings with wavelets

  2002cites this paper
• Two-dimensional substring indexing

  2001cites this paper
• A Database Index to Large Biological Sequences

  2001cites this paper
• A Fast Index for Semistructured Data

  2001cites this paper
• Biological sequence indexing using persistent Java

  2001cites this paper
• Efficient Index Structures for String Databases

  2001cites this paper
• Persistent Suux Trees and Suux Binary Search Trees as Dna Sequence Indexes

  2000cites this paper
• Towards Progressive Searching of Biological Sequences

  year unknowncites this paper