Sciweavers

164 search results - page 21 / 33
» Reverse Top-k Queries
Sort
View
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
14 years 10 months ago
A Data Structure for Sponsored Search
Abstract-- Inverted files have been very successful for document retrieval, but sponsored search is different. Inverted files are designed to find documents that match the query (a...
Arnd Christian König, Kenneth Ward Church, Ma...
SSDBM
2009
IEEE
149views Database» more  SSDBM 2009»
14 years 3 months ago
Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
Hans-Peter Kriegel, Peer Kröger, Matthias Ren...
ESWS
2004
Springer
14 years 1 months ago
Reverse Engineering of Relational Databases to Ontologies
Abstract. We propose a novel approach to reverse engineering of relational databases to ontologies. Our approach is based on the idea that semantics of a relational database can be...
Irina Astrova
FOCS
2009
IEEE
14 years 10 days ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
MTA
2007
141views more  MTA 2007»
13 years 8 months ago
Flexible integration of multimedia sub-queries with qualitative preferences
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...