1007 search results - page 65 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
110
click to vote
ICDT
2005
ACM
15 years 8 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
207
click to vote
VLDB
2008
ACM
16 years 3 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
127
click to vote
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de�...
138
click to vote
ESCIENCE
2007
IEEE
15 years 7 months ago
2007
IEEE
Provenance management has become increasingly important to support scientific discovery reproducibility, result interpretation, and problem diagnosis in scientific workflow enviro...
261
click to vote
ICDE
2008
IEEE
17 years 2 months ago
2008
IEEE
This paper introduces an efficient algorithm for Producing Early Results in Multi-join query plans (PermJoin, for short). While most previous research focuses only on the
case of ...