Sciweavers

505 search results - page 45 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
15 years 11 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
SIGMOD
1995
ACM
88views Database» more  SIGMOD 1995»
15 years 1 months ago
Semantic Assumptions and Query Evaluation in Temporal Databases
When querying a temporal database, a user often makes certain semantic assumptions on stored temporal data. This paper formalizes and studies two types of semantic assumptions: po...
Claudio Bettini, Xiaoyang Sean Wang, Elisa Bertino...
CIKM
2010
Springer
14 years 8 months ago
Query optimization for ontology-based information integration
In recent years, there has been an explosion of publicly available RDF and OWL data sources. In order to effectively and quickly answer queries in such an environment, we present...
Yingjie Li, Jeff Heflin
DLOG
2011
14 years 1 months ago
Dependencies to Optimize Ontology Based Data Access
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...
Mariano Rodriguez-Muro, Diego Calvanese
WISE
2000
Springer
15 years 2 months ago
Object-Oriented Mediator Queries to XML Data
The mediator/wrapper approach is used to integrate data from different databases and other data sources by introducing a middleware virtual database that provides high level abstr...
Hui Lin, Tore Risch, Timour Katchaounov