Database Paper Browser

Back to papers

Two-dimensional Substring Indexing

Summary: Reduce 2D substring indexing to the geometric “common colors in two ranges” problem, yielding the first I/O-efficient index with polylogarithmic query bounds for correlated substring queries. Provide an I/O-efficient common-colors algorithm and a family of exact secondary-memory indices (space/time tradeoffs) realizable by combining string B-trees and R-trees. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1244
Venue
PODS
Year
2001
Pagerank
5.2119402e-05
Overall Rank
6,097 | 57.59%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
2,531 The CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB Integration 2007 CIDR 8.5911728e-05
11,656 Autocompletion for Prefix-Abbreviated Input 2019 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers