2121 search results - page 139 / 425 » Indexing Incomplete Databases |
241
Voted
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
157
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
Well-designed indices can dramatically improve query performance. Including query workload information can produce indices that yield better overall throughput while balancing the...
191
Voted
BTW
2003
Springer
15 years 10 months ago
2003
Springer
Abstract: Optimization of nested queries, in particular finding equivalent “flattened” queries for queries that employ the SQL sub-query construct, has been researched extensiv...
147
Voted
ADBIS
1997
Springer
15 years 9 months ago
1997
Springer
Today, two classes of indexing methods enjoying wide applicability are the Inverted Index and the Superimposed Coding based Signature File (SC-SF). The former is most efficient i...
159
click to vote
CIKM
2005
Springer
15 years 7 months ago
2005
Springer
A critical issue in moving object databases is to develop appropriate indexing structures for continuously moving object locations so that queries can still be performed efficien...