76 search results - page 6 / 16 » Boolean ranking: querying a database by k-constrained opti... |
159
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
108
click to vote
SIGMOD
2011
ACM
14 years 7 days ago
2011
ACM
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
VLDB
2001
ACM
15 years 1 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
BTW
2003
Springer
15 years 2 months ago
2003
Springer
Abstract: Query languages for XML such as XPath or XQuery support Boolean retrieval where a query result is a (possibly restructured) subset of XML elements or entire documents tha...