Sciweavers

1679 search results - page 151 / 336
» Strong order equivalence
Sort
View
168
Voted
SIGMOD
1992
ACM
160views Database» more  SIGMOD 1992»
15 years 9 months ago
Extensible/Rule Based Query Rewrite Optimization in Starburst
This paper describes the Query Rewrite facility of the Starburst extensible database system, a novel phase of query optimization. We present a suite of rewrite rules used in Starb...
Hamid Pirahesh, Joseph M. Hellerstein, Waqar Hasan
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
15 years 9 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng
128
Voted
ITP
2010
156views Mathematics» more  ITP 2010»
15 years 8 months ago
The Optimal Fixed Point Combinator
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
Arthur Charguéraud
115
Voted
DATE
2009
IEEE
64views Hardware» more  DATE 2009»
15 years 8 months ago
Speculative reduction-based scalable redundancy identification
The process of sequential redundancy identification is the cornerstone of sequential synthesis and equivalence checking frameworks. The scalability of the proof obligations inhere...
Hari Mony, Jason Baumgartner, Alan Mishchenko, Rob...
176
Voted
CG
2006
Springer
15 years 8 months ago
A Skat Player Based on Monte-Carlo Simulation
We apply Monte Carlo simulation and alpha-beta search to the card game of Skat, which is similar to Bridge, but different enough to require some new algorithmic ideas besides the t...
Sebastian Kupferschmid, Malte Helmert