Sciweavers

505 search results - page 32 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
AMW
2010
14 years 11 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
AIMSA
2010
Springer
14 years 11 months ago
Expressive Approximations in DL-Lite Ontologies
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
Elena Botoeva, Diego Calvanese, Mariano Rodriguez-...
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
14 years 11 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
176
Voted
VLDB
2001
ACM
157views Database» more  VLDB 2001»
15 years 10 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
IJCAI
2003
14 years 11 months ago
Querying Distributed Data through Distributed Ontologies: A Simple but Scalable Approach
In this paper, we define a simple but scalable framework for peer-to-peer data sharing systems, in which the problem of answering queries over a network of semantically related p...
François Goasdoué, Marie-Christine R...