Sciweavers

20 search results - page 2 / 4
» Pushing extrema aggregates to optimize logic queries
Sort
View
SPAA
2006
ACM
14 years 7 days ago
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Consider a network in which a collection of source nodes maintain and periodically update data objects for a collection of sink nodes, each of which periodically accesses the data...
R. C. Chakinala, Abishek Kumarasubramanian, Kofi A...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 1 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
ESWS
2009
Springer
14 years 26 days ago
A Rule System for Querying Persistent RDFS Data
We present GiaBATA, a system for storing, aggregating, and querying Semantic Web data, based on declarative logic programming technology, namely on the dlvhex system, which allows ...
Giovambattista Ianni, Thomas Krennwallner, Alessan...
SCCC
2005
IEEE
13 years 12 months ago
Optimizing repair programs for consistent query answering
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
Mónica Caniupán Marileo, Leopoldo E....
DMDW
2000
161views Management» more  DMDW 2000»
13 years 7 months ago
View materialization for nested GPSJ queries
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
Matteo Golfarelli, Stefano Rizzi