Sciweavers

1238 search results - page 47 / 248
» View-based query containment
Sort
View
FCT
2001
Springer
15 years 7 months ago
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
This paper presents the prediction-preserving reducibility with membership queries (pwm-reducibility) on formal languages, in particular, simple CFGs and finite unions of regular ...
Kouichi Hirata, Hiroshi Sakamoto
EUROPAR
2000
Springer
15 years 6 months ago
Scheduling Queries for Tape-Resident Data
Tertiary storage systems are used when secondary storage can not satisfy the data storage requirements and/or it is a more cost effective option. The new application domains requir...
Sachin More, Alok N. Choudhary
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 3 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
16 years 3 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
WWW
2010
ACM
15 years 10 months ago
LCA-based selection for XML document collections
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
Georgia Koloniari, Evaggelia Pitoura