Sciweavers

23201 search results - page 14 / 4641
» Rewriting Systems with Data
Sort
View
WIDM
2003
ACM
14 years 27 days ago
Query rewriting using views in the presence of inclusion dependencies
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
Qingyuan Bai, Jun Hong, Michael F. McTear
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 9 months ago
Rewriting Regular XPath Queries on XML Views
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...
Wenfei Fan, Floris Geerts, Xibei Jia, Anastasios K...
BIRTHDAY
2005
Springer
14 years 1 months ago
Primitive Rewriting
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
Nachum Dershowitz
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 5 months ago
Trajectory Codes for Flash Memory
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
Anxiao Jiang, Michael Langberg, Moshe Schwartz, Je...
RTA
2005
Springer
14 years 1 months ago
Proving Positive Almost-Sure Termination
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
Olivier Bournez, Florent Garnier