Sciweavers

677 search results - page 86 / 136
» The XML Typechecking Problem
Sort
View
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
16 years 5 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
LICS
2002
IEEE
15 years 11 months ago
Monadic Queries over Tree-Structured Data
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
Georg Gottlob, Christoph Koch
FOSSACS
2007
Springer
16 years 5 days ago
Complexity Results on Balanced Context-Free Languages
Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Akihiko Tozawa, Yasuhiko Minamide
DDEP
2000
Springer
15 years 10 months ago
GODDAG: A Data Structure for Overlapping Hierarchies
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...
C. M. Sperberg-McQueen, Claus Huitfeldt
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
15 years 9 months ago
A UML Profile for Core Components and their Transformation to XSD
In business-to-business e-commerce, traditional electronic data interchange (EDI) approaches such as UN/EDIFACT have been superseded by approaches like web services and ebXML. Nev...
Christian Huemer, Philipp Liegl