3225 search results - page 358 / 645 » Query Optimization by Stored Queries |
159
click to vote
ICLP
2007
Springer
16 years 23 days ago
2007
Springer
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
154
click to vote
VLDB
2005
ACM
16 years 3 days ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
168
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
173
click to vote
DEXAW
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper describes an algebra for use with parallel object databases, and in particular ODMG compliant databases with OQL. Although there have been many proposals for parallel r...
153
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDm...