101 search results - page 17 / 21 » Partitioning techniques for fine-grained indexing |
ESA
2010
Springer
13 years 10 months ago
2010
Springer
Text search engines return a set of k documents ranked by similarity to a query. Typically, documents and queries are drawn from natural language text, which can readily be partiti...
EDBT
2008
ACM
14 years 9 months ago
2008
ACM
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
An optimization query asks for one or more data objects that maximize or minimize some function over the data set. We propose a general class of queries, model-based optimization ...
DAWAK
2009
Springer
13 years 7 months ago
2009
Springer
Enhancing on line analytical processing through efficient cube computation plays a key role in Data Warehouse management. Hashing, grouping and mining techniques are commonly used ...
SIGMOD
2010
ACM
13 years 4 months ago
2010
ACM
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...