{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:48:33Z","timestamp":1749221313477},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414810"},{"type":"electronic","value":"9783540445432"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44543-9_7","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T14:23:52Z","timestamp":1181226232000},"page":"99-117","source":"Crossref","is-referenced-by-count":15,"title":["Extensions of Attribute Grammars for Structured Document Queries"],"prefix":"10.1007","author":[{"given":"Frank","family":"Neven","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,4,13]]},"reference":[{"key":"7_CR1","unstructured":"S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999. 101"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/s007780050056","volume":"7","author":"S. Abiteboul","year":"1998","unstructured":"S. Abiteboul, S. Cluet, and T. Milo. A logical view of structured files. VLDB Journal, 7(2):96\u2013114, 1998. 99, 114","journal-title":"VLDB Journal"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/381854.381890","volume":"25","author":"R. Beaza-Yates","year":"1996","unstructured":"R. Beaza-Yates and G. Navarro. Integrating contents and structure in text retrieval. ACM SIGMOD Record, 25(1):67\u201379, March 1996. 101","journal-title":"ACM SIGMOD Record"},{"key":"7_CR4","series-title":"Lect Notes Comput Sci","first-page":"296","volume-title":"Database Theory \u2014 ICDT99","author":"C. Beeri","year":"1998","unstructured":"C. Beeri and T. Milo. Schemas for integration and translation of structured and semi-structured data. In P. Buneman C. Beeri, editor, Database Theory \u2014 ICDT99, volume 1540 of Lecture Notes in Computer Science, pages 296\u2013313. Springer-Verlag, 1998. 99"},{"key":"7_CR5","unstructured":"R. Bloem and J. Engelfriet. Characterization of properties and relations definedin monadic second order logic on the nodes of trees. Technical Report 97-03, Rijksuniversiteit Leiden, 1997. 102"},{"key":"7_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-63246-8_9","volume-title":"Structures in Logic and Computer Science","author":"R. Bloem","year":"1997","unstructured":"R. Bloem and J. Engelfriet. Monadic second order logic and node relations on graphs and trees. In J. Mycielski, G. Rozenberg, and A. Salomaa, editors, Structures in Logic and Computer Science, volume 1261 of Lecture Notes in Computer Science, pages 144\u2013161. Springer-Verlag, 1997. 109"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1109\/T-C.1971.223204","volume":"c-20","author":"R. Book","year":"1971","unstructured":"R. Book, S. Even, S. Greibach, and G. Ott. Ambiguity in graphs and expressions. IEEE Transactions on Computers, c-20(2):149\u2013153, 1971. 100, 103","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/inco.1997.2688","volume":"140","author":"A. Br\u00fcggemann-Klein","year":"1998","unstructured":"A. Br\u00fcggemann-Klein and Wood D. One unambiguous regular languages. Information and Computation, 140(2):229\u2013253, 1998. 100","journal-title":"Information and Computation"},{"key":"7_CR9","unstructured":"A. Br\u00fcggemann-Klein, M. Murata, and D. Wood. Regular tree languages over non-ranked alphabets (draft 1). Unpublished manuscript, 1998. 100, 114"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0022-0000(86)90036-X","volume":"32","author":"B. S. Chlebus","year":"1986","unstructured":"B. S. Chlebus. Domino-tiling games. Journal of Computer and System Sciences, 32(3):374\u2013392, 1986. 111","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1006\/jcss.1998.1564","volume":"3","author":"M. Consens","year":"1998","unstructured":"M. Consens and T. Milo. Algebras for querying text regions: Expressive power and optimization. Journal of Computer and System Sciences, 3:272\u2013288, 1998. 102, 110, 111, 112","journal-title":"Journal of Computer and System Sciences"},{"issue":"8","key":"7_CR12","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0306-4379(98)00028-3","volume":"23","author":"V. Crescenzi","year":"1998","unstructured":"V. Crescenzi and G. Mecca. Grammars have exceptions. Information Systems\u2013Special Issue on Semistructured Data, 23(8):539\u2013565, 1998. 114","journal-title":"Information Systems\u2013Special Issue on Semistructured Data"},{"key":"7_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Attribute Grammars: Definition, Systems and Bibliography","author":"P. Deransart","year":"1988","unstructured":"P. Deransart, M. Jourdan, and B. Lorho. Attribute Grammars: Definition, Systems and Bibliography, volume 323 of Lecture Notes in Computer Science. Springer, 1988. 100"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"A. Deutsch, M. Fernandez, D. Florescu, A. Levy, and D. Suciu. XML-QL: a query language for XML. In Proceedings of the WWW8 Conference, Toronto, 1999.","DOI":"10.1016\/S1389-1286(99)00020-1"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995. 110","DOI":"10.1007\/3-540-28788-4"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg and M. Steinby. Tree languages. In Rozenberg and Salomaa [34], chapter 1. 100","DOI":"10.1007\/978-3-642-59126-6_1"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0304-3975(96)00119-3","volume":"169","author":"N. Globerman","year":"1996","unstructured":"N. Globerman and D. Harel. Complexity results for two-way and multi-pebble automata and their logics. Theoretical Computer Science, 169(2):161\u2013184, 1996.","journal-title":"Theoretical Computer Science"},{"key":"7_CR18","unstructured":"G. H. Gonnet and F.W. Tompa. Mind your grammar: a new approach to modelling text. In Proceedings 13th Conference on VLDB, pages 339\u2013346, 1987. 99"},{"issue":"6","key":"7_CR19","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1137\/S0097539790188168","volume":"23","author":"M. Gyssens","year":"1994","unstructured":"M. Gyssens, J. Paredaens, and D. Van Gucht. A grammar-based approach towards unifying hierarchical data models. SIAM Journal on Computing, 23(6):1093\u20131137, 1994. 99","journal-title":"SIAM Journal on Computing"},{"issue":"12","key":"7_CR20","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1145\/361227.361231","volume":"18","author":"M. Jazayeri","year":"1975","unstructured":"M. Jazayeri, W. F. Ogden, and W. C. Rounds. The intrinsically exponential complexity of the circularity problem for attribute grammars. Communications of the ACM, 18(12):697\u2013706, 1975. 102, 109","journal-title":"Communications of the ACM"},{"key":"7_CR21","unstructured":"P. Kilpel\u00e4inen, G. Lind\u00e9n, H. Mannila, and E. Nikunen. A structured text database system. In R. Furuta, editor, Proceedings of the International Conference on Electronic Publishing, Document Manipulation & Typography, The Cambridge Series on Electronic Publishing, pages 139\u2013151. Cambridge University Press, 1990. 99, 114"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"P. Kilpel\u00e4inen and H. Mannila. Retrieval from hierarchical texts by partial patterns. In Proceedings of the Sixteenth International Conference on Research and Development in Information Retrieval, pages 214\u2013222. ACM Press, 1993. 101","DOI":"10.1145\/160688.160722"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"P. Kilpel\u00e4inen and H. Mannila. Query primitives for tree-structured data. In M. Crochemore and D. Gusfield, editors, Proceedings of the fifth Symposium on Combinatorial Pattern Matching, pages 213\u2013225. Springer-Verlag, 1994. 101","DOI":"10.1007\/3-540-58094-8"},{"issue":"2","key":"7_CR24","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"D. E. Knuth","year":"1968","unstructured":"D. E. Knuth. Semantics of context-free languages. Mathematical Systems Theory, 2(2):127\u2013145, 1968. See also Mathematical Systems Theory, 5(2):95\u201396, 1971. 100, 102","journal-title":"Mathematical Systems Theory"},{"key":"7_CR25","unstructured":"M. Murata. Forest-regular languages and tree-regular languages. Unpublished manuscript, 1995. 100"},{"key":"7_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/978-3-540-49382-2_12","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"A. Neumann","year":"1998","unstructured":"A. Neumann and H. Seidl. Locating matches of tree patterns in forests. In V. Arvind and R. Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, pages 134\u2013145. Springer, 1998. 101"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"F. Neven. Structured document query languages based on attribute grammars: locality and non-determinism. In T. Ripke T. Polle and K.-D. Schewe, editors, Fundamentals of Information Systems, pages 129\u2013142. Kluwer, 1998. 100, 104","DOI":"10.1007\/978-1-4615-5137-9_9"},{"key":"7_CR28","unstructured":"F. Neven. Design and Analysis of Query Languages for Structured Documents \u2014 A Formal and Logical Approach. Doctor\u2019s thesis, Limburgs Universitair Centrum (LUC), 1999. 102, 110"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"F. Neven and T. Schwentick. Query automata. In Proceedings of the Eighteenth ACM Symposium on Principles of Database Systems, pages 205\u2013214. ACM Press, 1999. 114","DOI":"10.1145\/303976.303997"},{"key":"7_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-63792-3_25","volume-title":"Deductive and Object-Oriented Databases","author":"F. Neven","year":"1997","unstructured":"F. Neven and J. Van den Bussche. On implementing structured document query facilities on top of a DOOD. In F. Bry, R. Ramakrishnan, and K. Ramamohanarao, editors, Deductive and Object-Oriented Databases, volume 1341 of Lecture Notes in Computer Science, pages 351\u2013367. Springer-Verlag, 1997. 100, 104"},{"key":"7_CR31","unstructured":"F. Neven and J. Van den Bussche. Expressiveness of structured document query languages based on attribute grammars. In Proceedings of the Seventeenth ACM Symposium on Principles of Database Systems, pages 11\u201317. ACM Press, 1998. 99, 100, 102, 104, 110"},{"issue":"6","key":"7_CR32","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0019-9958(68)90999-6","volume":"13","author":"C. Pair","year":"1968","unstructured":"C. Pair and A. Quere. D\u00e9finition et etude des bilangages r\u00e9guliers. Information and Control, 13(6):565\u2013593, 1968. 100","journal-title":"Information and Control"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"G. Rozenberg and A. Salomaa, editors. Handbook of Formal Languages, volume 3. Springer, 1997. 115, 117","DOI":"10.1007\/978-3-662-07675-0"},{"key":"7_CR34","first-page":"277","volume":"41","author":"A. Salminen","year":"1992","unstructured":"A. Salminen and F. Tompa. PAT expressions: an algebra for text search. Acta Linguistica Hungarica, 41:277\u2013306, 1992. 111","journal-title":"Acta Linguistica Hungarica"},{"key":"7_CR35","unstructured":"D. Suciu. Semistructured data and XML. In Proceedings of the 5th International Conference on Foundations of Data Organization and Algorithms, 1998. 99, 101"},{"issue":"1","key":"7_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(75)90058-3","volume":"27","author":"M. Takahashi","year":"1975","unstructured":"M. Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control, 27(1):1\u201336, 1975. 100","journal-title":"Information and Control"},{"key":"7_CR37","unstructured":"W. Thomas. Languages, automata, and logic. In Rozenberg and Salomaa [34], chapter 7. 100"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"M. Y. Vardi. Automata theory for database theoreticians. In Proceedings of the Eighth ACM Symposium on Principles of Database Systems, pages 83\u201392. ACM Press, 1989.","DOI":"10.1145\/73721.73729"}],"container-title":["Lecture Notes in Computer Science","Research Issues in Structured and Semistructured Database Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44543-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T03:48:35Z","timestamp":1683863315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44543-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414810","9783540445432"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/3-540-44543-9_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}