333 search results - page 17 / 67 » Query Optimization Using Local Completeness |
WAIM
2004
Springer
14 years 1 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
DLOG
2011
12 years 11 months ago
2011
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
AAAI
2000
13 years 9 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Research in modeling and querying spatial data has primarily focused on traditional "crisp" spatial objects with exact location and spatial extent. More recent work, how...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...