76 search results - page 10 / 16 » Boolean ranking: querying a database by k-constrained opti... |
178
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
195
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
WSDM
2009
ACM
15 years 4 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
The UQBE is a mashup tool for non-programmers that supports query-by-example (QBE) over a schema made up by the user without knowing the schema of the original sources. Based on a...
DASFAA
2009
IEEE
15 years 4 months ago
2009
IEEE
In Deep Web data integration, some Web database interfaces express exclusive predicates of the form Qe = Pi(Pi ∈ P1, P2, . . . , Pm), which permits only one predicate to be selec...