Sciweavers

3368 search results - page 126 / 674
» The Complexity of Query Reliability
Sort
View
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 10 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 10 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 10 months ago
Mining all frequent projection-selection queries from a relational table
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
Tao-Yuan Jen, Dominique Laurent, Nicolas Spyratos
EDBT
2008
ACM
158views Database» more  EDBT 2008»
14 years 10 months ago
Expressive query specification through form customization
A form-based query interface is usually the preferred means to provide an unsophisticated user access to a database. Not only is such an interface easy to use, requiring no techni...
Magesh Jayapandian, H. V. Jagadish
EDBT
2010
ACM
202views Database» more  EDBT 2010»
14 years 4 months ago
Querying trajectories using flexible patterns
The wide adaptation of GPS and cellular technologies has created many applications that collect and maintain large repositories of data in the form of trajectories. Previous work ...
Marcos R. Vieira, Petko Bakalov, Vassilis J. Tsotr...