Sciweavers

261 search results - page 7 / 53
» An Optimization Technique for Answering Regular Path Queries
Sort
View
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
15 years 3 months ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
15 years 9 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
15 years 9 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
SIGMOD
2006
ACM
109views Database» more  SIGMOD 2006»
15 years 9 months ago
OMCAT: optimal maintenance of continuous queries' answers for trajectories
We present our prototype system, OMCAT, which optimizes the reevaluation of a set of pending continuous spatio-temporal queries on trajectory data, when some of the trajectories a...
Hui Ding, Goce Trajcevski, Peter Scheuermann
AAAI
2008
14 years 11 months ago
Worst-case Optimal Conjunctive Query Answering for an Expressive Description Logic without Inverses
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications, and has thus been studied by many auth...
Magdalena Ortiz, Mantas Simkus, Thomas Eiter