Sciweavers

415 search results - page 8 / 83
» Efficient Processing of Relational Queries with Sum Constrai...
Sort
View
PVLDB
2008
138views more  PVLDB 2008»
13 years 6 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
PODS
2006
ACM
138views Database» more  PODS 2006»
14 years 7 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
IJWIS
2008
110views more  IJWIS 2008»
13 years 7 months ago
Determined: a system with novel techniques for XML query optimization and evaluation
: Purpose -- Efficient processing of XML queries is critical for XML data management and related applications. Previously proposed techniques are unsatisfactory. This article prese...
Dunren Che, Wen-Chi Hou
SIGMOD
2005
ACM
164views Database» more  SIGMOD 2005»
14 years 7 months ago
RankSQL: Query Algebra and Optimization for Relational Top-k Queries
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas...
WAIM
2004
Springer
14 years 21 days ago
Learning-Based Top-N Selection Query Evaluation over Relational Databases
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
Liang Zhu, Weiyi Meng