Sciweavers

7868 search results - page 112 / 1574
» Learning by Answer Sets
Sort
View
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
15 years 10 months ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...
SEMWEB
2009
Springer
15 years 9 months ago
A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL
Scalable query answering over Description Logic (DL) based ontologies plays an important role for the success of the Semantic Web. Towards tackling the scalability problem, we prop...
Jianfeng Du, Guilin Qi, Jeff Z. Pan, Yi-Dong Shen
RTA
2010
Springer
15 years 8 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
15 years 8 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo
EDBT
2009
ACM
131views Database» more  EDBT 2009»
15 years 7 months ago
Sample synopses for approximate answering of group-by queries
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
Philipp Rösch, Wolfgang Lehner