559 search results - page 14 / 112 » Indexing Weighted-Sequences in Large Databases |
ICCS
2007
Springer
14 years 1 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 ...
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
While the desire to support fast, ad hoc query processing for large data warehouses has motivated the
VLDB
1993
ACM
13 years 11 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
DATESO
2010
13 years 5 months ago
2010
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high ...