Rewrite rules for search database systems

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2011, Pages 271-282

  Fagin, Ronald ^a   Kimelfeld, Benny ^a   Li, Yunyao ^a   Raghavan, Sriram ^b   Vaithyanathan, Shivakumar ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b IBM INDIA RESEARCH LAB   (India)

Author keywords

Rewriting; Search database system

Indexed keywords

AUXILIARY DATA; FIXPOINTS; POLYNOMIAL-TIME; REWRITE RULES; REWRITING; SAFETY CONDITION; SAFETY GUARANTEES; SEARCH DATABASE SYSTEMS; SEARCH QUERIES; USER QUERY;

POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; SALINITY MEASUREMENT;

SEARCH ENGINES;

EID: 79960154253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989284.1989322     Document Type: Conference Paper

References (26)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theor. Comput. Sci., 236(1-2):133-178, 2000.
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. (Pubitemid 18576037)
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.
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.
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. (Pubitemid 41272973)
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.
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.
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.
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.
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. (Pubitemid 46946583)
13. S. Kaplan. Conditional rewrite rules. Theor. Comput. Sci., 33:175-193, 1984.
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.
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.
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.
20. S. Lucas. Context-sensitive computations in confluent programs. In PLILP, volume 1140 of Lecture Notes in Computer Science, pages 408-422. Springer, 1996. (Pubitemid 126129050)
21. F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3):39-46, 2002.
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.
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.
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. (Pubitemid 47582278)