486 search results - page 17 / 98 » Evaluating Top-k Queries over Web-Accessible Databases |
115
click to vote
MTA
2007
15 years 29 days ago
2007
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 ...
151
click to vote
PODS
2010
ACM
15 years 6 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
102
click to vote
VLDB
2005
ACM
15 years 7 months ago
2005
ACM
We study XML stream-specific schema-based optimization. We assume a widely-adopted automata-based execution model for XQuery evaluation. Criteria are established regarding what s...
203
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
173
click to vote
SIGMOD
2012
ACM
13 years 3 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...