14 search results - page 3 / 3 » Evaluation of a Dynamic Tree Structure for Indexing Query Re... |
VLDB
2007
ACM
13 years 11 months ago
2007
ACM
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
DEXA
2009
Springer
13 years 11 months ago
2009
Springer
Metric access methods (MAMs) serve as a tool for speeding similarity queries. However, all MAMs developed so far are index-based; they need to build an index on a given database. T...
SSD
2001
Springer
13 years 9 months ago
2001
Springer
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...