Sciweavers

2514 search results - page 93 / 503
» On the Computation of Approximations of Database Queries
Sort
View
INFSOF
2007
98views more  INFSOF 2007»
15 years 6 months ago
Indexing range sum queries in spatio-temporal databases
Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving ob...
Hyung-Ju Cho, Chin-Wan Chung
EUROPAR
2004
Springer
15 years 11 months ago
OLAP Query Processing in a Database Cluster
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
Alexandre A. B. Lima, Marta Mattoso, Patrick Valdu...
DKE
2010
167views more  DKE 2010»
15 years 6 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....
DEXA
2005
Springer
112views Database» more  DEXA 2005»
15 years 12 months ago
Distribution Rules for Array Database Queries
Abstract. Non-trivial retrieval applications involve complex computations on large multi-dimensional datasets. These should, in principle, benefit from the use of relational datab...
Alex van Ballegooij, Roberto Cornacchia, Arjen P. ...
CORR
2011
Springer
175views Education» more  CORR 2011»
15 years 1 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...