Sciweavers

148 search results - page 17 / 30
» Propagating XML Constraints to Relations
Sort
View
LICS
2010
IEEE
13 years 6 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
VLDB
2004
ACM
124views Database» more  VLDB 2004»
14 years 27 days ago
Containment of Nested XML Queries
Query containment is the most fundamental relationship between a pair of database queries: a query Q is said to be contained in a query Q if the answer for Q is always a subset of...
Xin Dong, Alon Y. Halevy, Igor Tatarinov
ICDE
2002
IEEE
129views Database» more  ICDE 2002»
14 years 9 months ago
Active XQuery
Besides being adopted as the new interchange format for the Internet, XML is finding increasing acceptance as a native data repository language. In order to make XML repositories ...
Angela Bonifati, Daniele Braga, Alessandro Campi, ...
IJCV
2006
158views more  IJCV 2006»
13 years 7 months ago
3D Structure Recovery and Unwarping of Surfaces Applicable to Planes
The deformation of applicable surfaces such as sheets of paper satisfies the differential geometric constraints of isometry (lengths and areas are conserved) and vanishing Gaussia...
Nail A. Gumerov, Ali Zandifar, Ramani Duraiswami, ...
PEPM
2011
ACM
12 years 10 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura