312 search results - page 22 / 63 » Indexing Gapped-Factors Using a Tree |
WEBDB
2005
Springer
14 years 3 months ago
2005
Springer
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
XSYM
2005
Springer
14 years 3 months ago
2005
Springer
Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using se...
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
ICCS
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
SSDBM
2003
IEEE
14 years 3 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...