Monadic datalog and the expressive power of languages for Web information extraction

Journal of the ACM

Volumn 51, Issue 1, 2004, Pages 74-113

  Gottlob, Georg ^a   Koch, Christoph ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Complexity; Expressiveness; HTML; Information extraction; Monadic datalog; MSO; Regular tree languages; Web wrapping

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; HTML; INFORMATION RETRIEVAL; QUERY LANGUAGES; TEXT PROCESSING;

MONADIC DATALOG; MSO; REGULAR TREE LANGUAGES; WEB WRAPPING;

WORLD WIDE WEB;

EID: 3142784673     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/962446.962450     Document Type: Conference Paper

References (45)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, Mass.
2. ABITEBOUL, S., AND VIANU, V. 1999. Regular path queries with constraints. J. Comput. Syst. Sci. 58, 3, 428-452.
3. AHO, A. V., BEERI, C., AND ULLMAN, J. D. 1979. The theory of joins in relational databases. ACM Trans. Datab. Syst. 4, 3, 297-314.
4. ATZENI, P., AND MECCA, G. 1997. Cut and paste. In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'97) (Tucson, Az.). ACM, New York.
5. BAUMGARTNER, R., FLESCA, S., AND GOTTLOB, G. 2001a. Declarative information extraction, web crawling, and recursive wrapping with lixto. In Proceedings of LPNMR'01 (Vienna, Austria).
6. BAUMGARTNER, R., FLESCA, S., AND GOTTLOB, G. 2001b. Visual web information extraction with lixto. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB'01).
7. BEERI, C., AND BERNSTEIN, P. A. 1979. Computational problems related to the design of normal form relational schemas. ACM Trans. Datab. Syst. 4, 1, 30-59.
8. BRÜGGEMANN-KLEIN, A., MURATA, M., AND WOOD, D. 2001. Regular tree and regular hedge languages over non-ranked alphabets: Version 1, April 3, 2001. Tech. Rep. HKUST-TCSC-2001-05, Hong Kong University of Science and Technology, Hong Kong SAR, China.
9. BRÜGGEMANN-KLEIN, A., AND WOOD, D. 2000. Caterpillars: A context specification technique. Markup Lang. 2, 1, 81-106.
10. CERI, S., GOTTLOB, G., AND TANCA, L. 1990. Logic Programming and Databases. Springer-Verlag, Berlin, Germany.
11. COSMADAKIS, S., GAIFMAN, H., KANELLAKIS, P., AND VARDI, M. 1988. Decidable optimization problems for database logic programs. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (Chicago, Ill.). ACM, New York, 477-490.
12. COURCELLE, B. 1990. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. 2. Elsevier Science Publishers B.V., Chap. 5, 193-242.
13. DONER, J. 1970. Tree acceptors and some of their applications. J. Comput. Syst. Sci. 4, 406-451.
14. DOWLING, W. F., AND GALLIER, J. H. 1984. Linear-time algorithms for testing the satisfiability of prepositional horn formulae. J. Logic Prog. 1, 3, 267-284.
15. EBBINGHAUS, H.-D., AND FLUM, J. 1999. Finite Model Theory. 2nd ed. Springer-Verlag, New York.
16. FLUM, J., FRICK, M., AND GROHE, M. 2001. Query evaluation via tree-decompositions. In Proceedings of the 8th International Conference on Database Theory (ICDT'01), J. Van den Bussche and V. Vianu, Eds. Lecture Notes in Computer Science, vol. 1973. Springer, New York, 22-38.
17. FRICK, M., AND GROHE, M. 2002. The complexity of first-order and monadic second-order logic revisited. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, Los Alamitos, Calif., 215-224.
18. FRICK, M., GROHE, M., AND KOCH, C. 2003. Query evaluation on compressed trees. In Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS) (Ottawa, Ont., Canada). IEEE Computer Society Press, Los Alamitos, Calif.
19. GÉCSEG, F., AND STEINBY, M. 1997. Tree languages. In Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds. Vol. 3. Springer-Verlag, New York, Chap. 1, 1-68.
20. GOTTLOB, G., GRÄDEL, E., AND VEITH, H. 2002. Datalog LITE: A deductive query language with linear-time model checking. ACM Trans. Computat. Logic 3, 1, 42-79.
21. GOTTLOB, G., AND KOCH, C. 2002. Monadic queries over tree-structured data. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS) (Copenhagen, Denmark). IEEE Computer Society Press, Los Alamitos, Calif., 189-202.
22. GOTTLOB, G., KOCH, C., AND PICHLER, R. 2002. Efficient algorithms for processing XPath queries. In Proceedings of the 28th International Conference on Very Large Data Bases (VLDB'02) (Hong Kong, China).
23. HOPCROFT, J. E., AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading, Mass.
24. LAENDER, A. H. F., RIBEIRO-NETO, B., AND S. DA SILVA, A. 2002. DEByE - Data Extraction By Example. Data Knowl. Eng. 40, 2 (Feb.), 121-154.
25. LIU, L., Pu, C., AND HAN, W. 2000. XWRAP: An XML-enabled wrapper construction system for web information sources. In Proceedings of the 16th IEEE International Conference on Data Engineering (ICDE) (San Diego, Calif.). ACM, New York, 611-621.
26. Lixto. http://www.lixto.com.
27. LUDÄSCHER, B., HIMMERÖDER, R., LAUSEN, G., MAY, W., AND SCHLEPPHORST, C. 1998. Managing semistructured data with florid: A deductive object-oriented perspective. Inf. Syst. 23, 8, 1-25.
28. MAIER, D., MENDELZON, A. O., AND SAGIV, Y. 1979. Testing implications of data dependencies. ACM Trans. Datab. Syst. 4, 4, 455-469.
29. MIKLAU, G., AND SUCIU, D. 2003. Containment and equivalence for an fragment of XPath. J. ACM 51, 1 (Jan.), 2-45.
30. MINOUX, M. 1988. LTUR: A simplified linear-time unit resolution algorithm for horn formulae and computer implementation. Inf. Proc. Lett. 29, 1, 1-12.
31. NEVEN, F. 2002. On the power of walking for querying tree-structured data. In Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'02). Madison, Wisconsin.
32. NEVEN, F., AND SCHWENTICK, T. 2000. Expressive and efficient pattern languages for tree-structured data. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'00) (Dallas, Tex.), ACM, New York, 145-156.
33. NEVEN, F., AND SCHWENTICK, T. 2002. Query automata on finite trees. Theoret. Comput. Sci. 275, 633-674.
34. NEVEN, F., AND SCHWENTICK, T. 2003. XPath containment in the presence of disjunction, DTDs, and variables. In Proceedings of the 9th International Conference on Database Theory (ICDT'03). 315-329.
35. NEVEN, F., AND VAN DEN BUSSCHE, J. 2002. Expressiveness of structured document query languages based on attribute grammars. J. ACM 49, 1 (Jan.), 56-100.
36. PAPADIMITRIOU, C. H. 1994. Computational Complexity. Addison-Wesley, Reading, Mass.
37. PAPAKONSTANTINOU, Y., GUPTA, A., GARCIA-MOLINA, H., AND ULLMAN, J. 1995. A query translation scheme for rapid implementation of wrappers. In Proceedings of the 4th International Conference on Deductive and Object-oriented Databases (DOOD'95) (Singapore), Springer-Verlag, New York, 161-186.
38. SAHUGUET, A., AND AZAVANT, F. 2001. Building intelligent web applications using lightweight wrappers. Data Knowl. Eng. 36, 3, 283-316.
39. SZILARD, A., YU, S., ZHANG, K., AND SHALLIT, J. 1992. Characterizing regular languages with polynomial densities. In Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 629. Springer-Verlag, Berlin, Germany, 494-503.
40. THATCHER, J., AND WRIGHT, J. 1968. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theory 2, 1, 57-81.
41. THOMAS, W. 1990. Automata on infinite objects. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. 2. Elsevier Science Publishers B.V., Chap. 4, 133-192.
42. THOMAS, W. 1997. Languages, automata, and logic. In Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds. Vol. 3. Springer-Verlag, New York, Chap. 7, 389-455.
43. WORLD WIDE WEB CONSORTIUM. 1999. XML Path Language (XPath) Recommendation. http://www. w3c.org/TR/xpath/.
44. YANNAKAKIS, M. 1981. Algorithms for acyclic database schemes. In Proceedings of the 7th International Conference on Very Large Data Bases (VLDB'81). 82-94.
45. YU, S. 1997. Regular languages. In Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds. Vol. 1. Springer-Verlag, New York, Chap. 2, 41-110.