912 search results - page 34 / 183 » Inductive Databases as Ranking |
SIGMOD
2007
ACM
14 years 10 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
SIGMOD
2007
ACM
14 years 10 months ago
2007
ACM
Numerous widely publicized cases of theft and misuse of private information underscore the need for audit technology to identify the sources of unauthorized disclosure. We present...
SIGMOD
2011
ACM
13 years 23 days ago
2011
ACM
Ranking queries report the top-K results according to a user-defined scoring function. A widely used scoring function is the weighted summation of multiple scores. Often times, u...
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
In recent years there has been a great deal of interest in developing effective techniques for ad-hoc search and retrieval in structured repositories such as relational databases ...
SIGMOD
2009
ACM
14 years 10 months ago
2009
ACM
We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching,...