Sciweavers

27 search results - page 5 / 6
» Consistent Query Answering: Opportunities and Limitations
Sort
View
EUROPAR
2001
Springer
13 years 9 months ago
Self-Organizing Hierarchical Cluster Timestamps
Distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to...
Paul A. S. Ward, David J. Taylor
DEXAW
2007
IEEE
142views Database» more  DEXAW 2007»
13 years 7 months ago
Synopsis Data Structures for XML Databases: Models, Issues, and Research Perspectives
Due to the lack of efficient native XML database management systems, XML data manipulation and query evaluation may be resource-consuming, and represent a bottleneck for several ...
Angela Bonifati, Alfredo Cuzzocrea
PVLDB
2010
120views more  PVLDB 2010»
13 years 3 months ago
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
George Beskales, Ihab F. Ilyas, Lukasz Golab
CIKM
1999
Springer
13 years 9 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 7 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher