A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Languages, automata, and logic
Handbook of formal languages, vol. 3
Expressiveness of structured document query languages based on attribute grammars
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Catching the boat with Strudel: experiences with a Web-site management system
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Macro tree transducers, attribute grammars, and MSO definable tree translations
Information and Computation
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressive and efficient pattern languages for tree-structured data (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A formal semantics of patterns in XSLT and XPath
Markup Languages
Quilt: An XML Query Language for Heterogeneous Data Sources
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Descriptive Complexity and Model Checking
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
On the power of walking for querying tree-structured data
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automata theory for XML researchers
ACM SIGMOD Record
Typechecking Top-Down Uniform Unranked Tree Transducers
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Structural Properties of XPath Fragments
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Two-Way Finite State Transducers with Nested Pebbles
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Typechecking for Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
On the power of tree-walking automata
Information and Computation - Special issue: ICC '99
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Frontiers of tractability for typechecking simple XML transformations
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incremental maintenance for materialized XPath/XSLT views
WWW '05 Proceedings of the 14th international conference on World Wide Web
Semantic characterizations of navigational XPath
ACM SIGMOD Record
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
LiXQuery: a formal foundation for XQuery research
ACM SIGMOD Record
Journal of Computer and System Sciences
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
Static validation of XSL transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
XML transformation by tree-walking transducers with invisible pebbles
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incomparability results for classes of polynomial tree series transformations
Journal of Automata, Languages and Combinatorics
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
Pebble Macro Tree Transducers with Strong Pebble Handling
Fundamenta Informaticae
Circularity, composition, and decomposition results for pebble macro tree transducers
Journal of Automata, Languages and Combinatorics
Domain ontology learning and consistency checking based on TSC approach and racer
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Application of logic wrappers to hierarchical data extraction from HTML
EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
Tree automata over infinite alphabets
Pillars of computer science
A learning algorithm for top-down XML transformations
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Satisfiability and containment problem of structural recursions with conditions
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
The complexity of text-preserving XML transformations
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Does o-substitution preserve recognizability?
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Web and semantic web query languages: a survey
Proceedings of the First international conference on Reasoning Web
Logic wrappers and XSLT transformations for tuples extraction from HTML
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
Mining travel resources on the web using l-wrappers
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Pebble Macro Tree Transducers with Strong Pebble Handling
Fundamenta Informaticae
Hi-index | 0.00 |
The extension of the eXtensible Style sheet Language (XSL) by variables and passing of data values between template rules has generated a powerful XML query language: eXtensible Style sheet Language Transformations (XSLT). An informal introduction to XSTL is given, on the bases of which a formal model of a fragment of XSLT is defined. This formal model is in the spirit of tree transducers, and its semantics is defined by rewrite relations. It is shown that the expressive power of the fragment is already beyond that of most other XML query languages. Finally, important properties such as termination and closure under composition are considered.