312 search results - page 5 / 63 » Indexing Gapped-Factors Using a Tree |
VLDB
2002
ACM
14 years 8 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
Many evolving database applications warrant the use of non-traditional indexing mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing framework that broade...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
ICDE
2007
IEEE
14 years 12 days ago
2007
IEEE
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
BTW
2005
Springer
14 years 2 months ago
2005
Springer
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...