Sciweavers

23201 search results - page 358 / 4641
» Rewriting Systems with Data
Sort
View
VLDB
2001
ACM
151views Database» more  VLDB 2001»
16 years 7 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
VLDB
2007
ACM
146views Database» more  VLDB 2007»
16 years 7 months ago
A Cost-Estimation Component for Statement Sequences
Query generators producing sequences of SQL statements are embedded in many applications. As the execution time of such sequences is often far from optimal, their optimization is ...
Tobias Kraft
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
16 years 7 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu
CC
2010
Springer
172views System Software» more  CC 2010»
16 years 1 months ago
Verifying Local Transformations on Relaxed Memory Models
The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory progr...
Sebastian Burckhardt, Madanlal Musuvathi, Vasu Sin...
FOSSACS
2009
Springer
16 years 1 months ago
On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
Christopher Broadbent, C.-H. Luke Ong