Sciweavers

1588 search results - page 58 / 318
» Consistent query answering in databases
Sort
View
DOLAP
2005
ACM
15 years 6 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
FUIN
2008
88views more  FUIN 2008»
15 years 4 months ago
Preferential Regular Path Queries
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down...
Gösta Grahne, Alex Thomo, William W. Wadge
SSD
1997
Springer
154views Database» more  SSD 1997»
15 years 8 months ago
On the Assessment of Generalisation Consistency
Theory, algorithms, techniques and tools for producing a generalisation of a map have long been available. In this paper we study the inverse problem, namely, given two maps L and...
Vasilis Delis, Thanasis Hadzilacos
SSD
2009
Springer
233views Database» more  SSD 2009»
15 years 10 months ago
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
Chi-Yin Chow, Mohamed F. Mokbel, Joe Naps, Suman N...
DAGSTUHL
1998
15 years 5 months ago
A Practical Approach to Hypothetical Database Queries
Hypothetical queries are queries embedding hypotheses about the database. The embedded hypothesis in a hypothetical query indicates, so to say, a state of the database intended for...
Henning Christiansen, Troels Andreasen