research-article

Rewrite rules for search database systems

Authors:

Benny Kimelfeld,

Sriram Raghavan,

Shivakumar VaithyanathanAuthors Info & Claims

PODS '11: Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 271 - 282

https://doi.org/10.1145/1989284.1989322

Published: 13 June 2011 Publication History

Abstract

The results of a search engine can be improved by consulting auxiliary data. In a search database system, the association between the user query and the auxiliary data is driven by rewrite rules that augment the user query with a set of alternative queries. This paper develops a framework that formalizes the notion of a rewrite program, which is essentially a collection of hedge-rewriting rules. When applied to a search query, the rewrite program produces a set of alternative queries that constitutes a least fixpoint (lfp). The main focus of the paper is on the lfp-convergence of a rewrite program, where a rewrite program is lfp-convergent if the least fixpoint of every search query is finite. Determining whether a given rewrite program is lfp-convergent is undecidable; to accommodate that, the paper proposes a safety condition, and shows that safety guarantees lfp-convergence, and that safety can be decided in polynomial time. The effectiveness of the safety condition in capturing lfp-convergence is illustrated by an application to a rewrite program in an implemented system that is intended for widespread use.

References

[1]

T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theor. Comput. Sci., 236(1-2):133--178, 2000.

Digital Library

[2]

J. Bear, D. J. Israel, J. Petit, and D. L. Martin. Using information extraction to improve document retrieval. In TREC, pages 367--377, 1997.

[3]

A. B. Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Sci. Comput. Program., 9(2):137--159, 1987.

Digital Library

[4]

N. Dershowitz. Orderings for term-rewriting systems. Theor. Comput. Sci., 17:279--301, 1982.

[5]

N. Dershowitz. Termination. In RTA, volume 202 of Lecture Notes in Computer Science, pages 180--224. Springer, 1985.

Digital Library

[6]

R. Fagin, B. Kimelfeld, Y. Li, S. Raghavan, and S. Vaithyanathan. Understanding queries in a search database system. In PODS, pages 273--284. ACM, 2010.

Digital Library

[7]

O. Fissore, I. Gnaedig, and H. Kirchner. A proof of weak termination providing the right way to terminate. In ICTAC, volume 3407 of Lecture Notes in Computer Science, pages 356--371. Springer, 2004.

Digital Library

[8]

J. V. Guttag, D. Kapur, and D. R. Musser. On proving uniform termination and restricted termination of rewriting systems. SIAM J. Comput., 12(1):189--214, 1983.

Digital Library

[9]

M. A. Hearst. Direction-based text interpretation as an information access refinement. In P. S. Jacobs, editor, Text-Based Intelligent Systems: Current Research and Practice in Information Extraction and Retrieval, pages 257--274. Erlbaum, Hillsdale, 1992.

Digital Library

[10]

P. S. Jacobs. Introduction: Text power and intelligent systems. In P. S. Jacobs, editor, Text-Based Intelligent Systems: Current Research and Practice in Information Extraction and Retrieval, pages 1--8. Erlbaum, Hillsdale, 1992.

Digital Library

[11]

F. Jacquemard and M. Rusinowitch. Closure of hedge-automata languages by hedge rewriting. In RTA, volume 5117 of Lecture Notes in Computer Science, pages 157--171. Springer, 2008.

Digital Library

[12]

E. Kandogan, R. Krishnamurthy, S. Raghavan, S. Vaithyanathan, and H. Zhu. Avatar semantic search: a database approach to information retrieval. In SIGMOD Conference, pages 790--792. ACM, 2006.

Digital Library

[13]

S. Kaplan. Conditional rewrite rules. Theor. Comput. Sci., 33:175--193, 1984.

Digital Library

[14]

D. Knuth and P. Bendix. Simple word problems in universal algebra. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263--297. Pergamon Press, 1970.

[15]

D. König. Theorie der Endlichen und Unendlichen Graphen: Kombinatorische Topologie der Streckenkomplexe. Akad. Verlag, Leipzig, 1936.

[16]

K. Korovin and A. Voronkov. Orienting rewrite rules with the Knuth-Bendix order. Inf. Comput., 183(2):165--186, 2003.

Digital Library

[17]

R. Krishnamurthy, Y. Li, S. Raghavan, F. Reiss, S. Vaithyanathan, and H. Zhu. SystemT: a system for declarative information extraction. SIGMOD Record, 37(4):7--13, 2008.

Digital Library

[18]

D. S. Lankford. On proving term rewriting systems are Noetherian. Technical report, Mathematics Department, Louisiana Tech. University, Ruston, 1979.

[19]

D. D. Lewis. Text representation for intelligent text retrieval: A classification-oriented view. In P. S. Jacobs, editor, Text-Based Intelligent Systems: Current Research and Practice in Information Extraction and Retrieval, pages 179--197. Erlbaum, Hillsdale, 1992.

Digital Library

[20]

S. Lucas. Context-sensitive computations in confluent programs. In PLILP, volume 1140 of Lecture Notes in Computer Science, pages 408--422. Springer, 1996.

Digital Library

[21]

F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3):39--46, 2002.

Digital Library

[22]

B. Pang and L. Lee. Using very simple statistics for review search: An exploration. In Proceedings of COLING: Companion volume: Posters, pages 73--76, 2008.

[23]

Y. Qiu and H.-P. Frei. Concept based query expansion. In SIGIR, pages 160--169. ACM, 1993.

Digital Library

[24]

F. Reiss, S. Raghavan, R. Krishnamurthy, H. Zhu, and S. Vaithyanathan. An algebraic approach to rule-based information extraction. In ICDE, pages 933--942. IEEE, 2008.

Digital Library

[25]

Terese. Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003.

[26]

H. Zhu, S. Raghavan, S. Vaithyanathan, and A. Löser. Navigating the intranet with high precision. In WWW, pages 491--500. ACM, 2007.

Digital Library

Cited By

Fagin RKimelfeld BReiss FVansummeren S(2016)Declarative Cleaning of Inconsistencies in Information ExtractionACM Transactions on Database Systems10.1145/287720241:1(1-44)Online publication date: 7-Apr-2016
https://dl.acm.org/doi/10.1145/2877202
Fagin RKimelfeld BReiss FVansummeren SHull RGrohe M(2014)Cleaning inconsistencies in information extraction via prioritized repairsProceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/2594538.2594540(164-175)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2594538.2594540
Hassanzadeh OKementsietsidis AKimelfeld BKrishnamurthy RÖzcan FPandis I(2013)Next generation data analytics at IBM researchProceedings of the VLDB Endowment10.14778/2536222.25362466:11(1174-1175)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.14778/2536222.2536246
Show More Cited By

Index Terms

Rewrite rules for search database systems
1. Information systems
  1. Information retrieval
    1. Information retrieval query processing
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
      1. Rewrite systems
    2. Grammars and context-free languages

Recommendations

Termination of rewrite relations on λ-terms based on Girard's notion of reducibility

In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of β-reduction in the polymorphic λ-calculus, to prove the termination of various kinds of rewrite relations on λ-terms, including rewriting ...
Improving Federated Database Queries Using Declarative Rewrite Rules for Quantified Subqueries

Transforming queries for efficient execution is particularly important in federated database systems since a more efficient execution plan can require many fewer data requests to be sent to the component databases. Also, it is important to do as much as ...
Rewrite Rules for Quantified Subqueries in a Federated Database
SSDBM '01: Proceedings of the 13th International Conference on Scientific and Statistical Database Management

Abstract: Transforming queries for efficient execution is particularly important in federated database systems since a more efficient execution plan can require many fewer data requests to be sent to the component databases. Also, it is important to do ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '11: Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

June 2011

332 pages

ISBN:9781450306607

DOI:10.1145/1989284

General Chair:
Maurizio Lenzerini
Sapienza University of Rome, Italy
,
Program Chair:
Thomas Schwentick
TU Dortmund University, Germany

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SIGMOD/PODS '11

Sponsor:

SIGMOD

SIGMOD/PODS '11: International Conference on Management of Data

June 13 - 15, 2011

Athens, Greece

Acceptance Rates

PODS '11 Paper Acceptance Rate 25 of 113 submissions, 22%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
377
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Fagin RKimelfeld BReiss FVansummeren S(2016)Declarative Cleaning of Inconsistencies in Information ExtractionACM Transactions on Database Systems10.1145/287720241:1(1-44)Online publication date: 7-Apr-2016
https://dl.acm.org/doi/10.1145/2877202
Fagin RKimelfeld BReiss FVansummeren SHull RGrohe M(2014)Cleaning inconsistencies in information extraction via prioritized repairsProceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/2594538.2594540(164-175)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2594538.2594540
Hassanzadeh OKementsietsidis AKimelfeld BKrishnamurthy RÖzcan FPandis I(2013)Next generation data analytics at IBM researchProceedings of the VLDB Endowment10.14778/2536222.25362466:11(1174-1175)Online publication date: 1-Aug-2013
https://dl.acm.org/doi/10.14778/2536222.2536246
Parameswaran AKaushik RArasu AHe QIyengar ANejdl WPei JRastogi R(2013)Efficient parsing-based search over structured dataProceedings of the 22nd ACM international conference on Information & Knowledge Management10.1145/2505515.2505764(49-58)Online publication date: 27-Oct-2013
https://dl.acm.org/doi/10.1145/2505515.2505764
Bao ZKimelfeld BLi YRaghavan SYang HChen XLebanon GWang HZaki M(2012)Gumshoe quality toolkitProceedings of the 21st ACM international conference on Information and knowledge management10.1145/2396761.2398737(2716-2718)Online publication date: 29-Oct-2012
https://dl.acm.org/doi/10.1145/2396761.2398737
Bao ZKimelfeld BLi YHersh WCallan JMaarek YSanderson M(2012)Automatic suggestion of query-rewrite rules for enterprise searchProceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval10.1145/2348283.2348363(591-600)Online publication date: 12-Aug-2012
https://dl.acm.org/doi/10.1145/2348283.2348363

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents