Sciweavers

30 search results - page 4 / 6
» The 1-Versus-2 Queries Problem Revisited
Sort
View
VLDB
2003
ACM
123views Database» more  VLDB 2003»
14 years 8 months ago
A case for fractured mirrors
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
Ravishankar Ramamurthy, David J. DeWitt, Qi Su
PODS
2010
ACM
242views Database» more  PODS 2010»
14 years 1 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
EWSN
2009
Springer
14 years 8 months ago
Multi-hop Cluster Hierarchy Maintenance in Wireless Sensor Networks: A Case for Gossip-Based Protocols
Multi-hop cluster hierarchy has been presented as an organization for large wireless sensor networks (WSNs) that can provide scalable routing, data aggregation, and querying. In th...
Konrad Iwanicki, Maarten van Steen
CIKM
2006
Springer
13 years 11 months ago
Annotation propagation revisited for key preserving views
This paper revisits the analysis of annotation propagation from source databases to views defined in terms of conjunctive (SPJ) queries. Given a source database D, an SPJ query Q,...
Gao Cong, Wenfei Fan, Floris Geerts
DBPL
2007
Springer
103views Database» more  DBPL 2007»
13 years 12 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach