Filters








235 Hits in 5.7 sec

Attribute grammars for unranked trees as a query language for structured documents

Frank Neven
2005 Journal of computer and system sciences (Print)  
Viewed as a query language, extended AGs are particularly relevant as they can take into account the inherent order of the children of a node in a document.  ...  Document specification languages, like for instance XML, model documents using extended context-free grammars.  ...  I thank them for providing me with a first draft of [13] . I thank Thomas Schwentick, Jan Van den Bussche, and Dirk Van Gucht for helpful discussions on topics treated in this paper.  ... 
doi:10.1016/j.jcss.2004.10.008 fatcat:h6w2etsrfbhghcweimx4sa5zmu

Automata theory for XML researchers

Frank Neven
2002 SIGMOD record  
As the structure of XML documents can be adequately represented by unranked trees, unranked tree automata can serve XML research in four different ways: (i) as a basis of schema languages [10, 12, 13,  ...  a new paradigm: unranked tree automata use regular string languages to deal with unrankedness.  ...  Acknowledgment The author thanks Dan Suciu, Leonid Libkin, Jan Van den Bussche, Wim Martens, and Stijn Vansummeren for comments on an earlier version of this paper.  ... 
doi:10.1145/601858.601869 fatcat:5eaun2gnrrg7jnujfpevj6usde

Reminiscences on influential papers

Kenneth A. Ross
2001 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/603867.603882 fatcat:hf5qg34b5ffh5nbfuhrewlxf4e

Reminiscences on influential papers

Kenneth A. Ross
2004 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/1041410.1041431 fatcat:ob6c5pwj7bf6nikdm5f2rtkcsu

Reminiscences on influential papers

Kenneth A. Ross
2002 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/507338.507364 fatcat:jchl62isl5ejne25q54al6f5vi

Reminiscences on influential papers

Kenneth A. Ross
2003 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/640990.641001 fatcat:lzsfk7exifca7hsqhypdcudpnq

Reminiscences on influential papers

Kenneth A. Ross, Theodore Johnson, Richard Thomas Snodgrass
2002 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/601858.601875 fatcat:h325rnltu5hjjnvip3alq3uo5u

Reminiscences on influential papers

Kenneth A. Ross
2005 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/1107499.1107520 fatcat:ui4xlto24ncevfmpj2ehxj7knq

Reminiscences on influential papers

Kenneth A. Ross
2005 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/1083784.1083801 fatcat:4rw5ytuxifcpvkrd62w4y655w4

Reminiscences on influential papers

Richard Snodgrass
1998 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/290593.290599 fatcat:7vfr5gbla5a25jve3i2kogkhxu

Reminiscences on influential papers

Kenneth A. Ross
2004 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/1024694.1024715 fatcat:7wu42iordbfaber5dvs6i42i5i

Reminiscences on influential papers

Kenneth A. Ross
2005 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/1058150.1058168 fatcat:vskm5zqr3jb5jdromrtn3uso6y

Reminiscences on influential papers

Kenneth A. Ross
2005 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/1084805.1084831 fatcat:twfstopscvgjnclm2fb7ycs22y

Reminiscences on influential papers

Kenneth A. Ross
2004 SIGMOD record  
as query languages.  ...  Their presentation of unranked tree automata did not only help me with my attribute grammars, it also had, and still has, a profound influence on all my research on foundations of XML.  ... 
doi:10.1145/1031570.1031581 fatcat:g3eyqfh7vbfdbn5wt2aem2cvb4

Automata- and Logic-Based Pattern Languages for Tree-Structured Data [chapter]

Frank Neven, Thomas Schwentick
2003 Lecture Notes in Computer Science  
This paper surveys work of the authors on pattern languages for tree-structured data with XML as the main application in mind. The main focus is on formalisms from formal language theory and logic.  ...  In particular, it considers attribute grammars, query automata, treewalking automata, extensions of first-order logic, and monadic secondorder logic.  ...  Attribute Grammars Attribute grammars (AGs), as defined by Knuth [16] , constitute a deeply studied general computational model for trees [9] .  ... 
doi:10.1007/3-540-36596-6_9 fatcat:647wylabnjfshdr6opbrzxflna
« Previous Showing results 1 — 15 out of 235 results