Sciweavers

1300 search results - page 219 / 260
» XML Query Processing and Optimization
Sort
View
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 1 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
SIGMOD
2006
ACM
102views Database» more  SIGMOD 2006»
16 years 1 months ago
DADA: a data cube for dominant relationship analysis
The concept of dominance has recently attracted much interest in the context of skyline computation. Given an Ndimensional data set S, a point p is said to dominate q if p is bett...
Cuiping Li, Beng Chin Ooi, Anthony K. H. Tung, Sha...
ADBIS
2006
Springer
182views Database» more  ADBIS 2006»
15 years 7 months ago
A Middleware-Based Approach to Database Caching
Database caching supports declarative query processing close to the application. Using a full-fledged DBMS as cache manager, it enables the evaluation of specific project-select-...
Andreas Bühmann, Theo Härder, Christian ...
EDBT
2008
ACM
135views Database» more  EDBT 2008»
16 years 1 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
126
Voted
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
15 years 8 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith