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.
- T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theor. Comput. Sci., 236(1-2):133--178, 2000. Google Scholar
Digital Library
- J. Bear, D. J. Israel, J. Petit, and D. L. Martin. Using information extraction to improve document retrieval. In TREC, pages 367--377, 1997.Google Scholar
- A. B. Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Sci. Comput. Program., 9(2):137--159, 1987. Google Scholar
Digital Library
- N. Dershowitz. Orderings for term-rewriting systems. Theor. Comput. Sci., 17:279--301, 1982.Google Scholar
- N. Dershowitz. Termination. In RTA, volume 202 of Lecture Notes in Computer Science, pages 180--224. Springer, 1985. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- S. Kaplan. Conditional rewrite rules. Theor. Comput. Sci., 33:175--193, 1984. Google Scholar
Digital Library
- 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.Google Scholar
- D. König. Theorie der Endlichen und Unendlichen Graphen: Kombinatorische Topologie der Streckenkomplexe. Akad. Verlag, Leipzig, 1936.Google Scholar
- K. Korovin and A. Voronkov. Orienting rewrite rules with the Knuth-Bendix order. Inf. Comput., 183(2):165--186, 2003. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- D. S. Lankford. On proving term rewriting systems are Noetherian. Technical report, Mathematics Department, Louisiana Tech. University, Ruston, 1979.Google Scholar
- 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. Google Scholar
Digital Library
- S. Lucas. Context-sensitive computations in confluent programs. In PLILP, volume 1140 of Lecture Notes in Computer Science, pages 408--422. Springer, 1996. Google Scholar
Digital Library
- F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3):39--46, 2002. Google Scholar
Digital Library
- 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.Google Scholar
- Y. Qiu and H.-P. Frei. Concept based query expansion. In SIGIR, pages 160--169. ACM, 1993. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- Terese. Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003.Google Scholar
- H. Zhu, S. Raghavan, S. Vaithyanathan, and A. Löser. Navigating the intranet with high precision. In WWW, pages 491--500. ACM, 2007. Google Scholar
Digital Library
Index Terms
Rewrite rules for search database systems
Recommendations
Rewrite Rules for Quantified Subqueries in a Federated Database
SSDBM '01: Proceedings of the 13th International Conference on Scientific and Statistical Database ManagementAbstract: 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 ...
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 ...
Developing a query optimizer for a federated database system
IIS '97: Proceedings of the 1997 IASTED International Conference on Intelligent Information Systems (IIS '97)This paper concerns our experiences in developing a query optimizer for the Cyrano prototype federated database system developed at Virginia Tech. We used a bottom-up evaluation method commonly seen in deductive systems. In Cyrano, queries and stored ...






Comments