Sciweavers

4180 search results - page 824 / 836
» A Query Language for XML
Sort
View
135
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 3 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
138
Voted
ICALP
2009
Springer
16 years 3 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
PODS
2004
ACM
158views Database» more  PODS 2004»
16 years 3 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
130
Voted
ICDT
2010
ACM
161views Database» more  ICDT 2010»
16 years 25 days ago
Composition with Target Constraints
It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a secondorder tgd (SO tgd). We consider the question of...
Marcelo Arenas, Ronald Fagin, Alan Nash
133
Voted
SAC
2010
ACM
15 years 10 months ago
Modeling cardinal directions in the 3D space with the objects interaction cube matrix
In GIS and spatial databases, cardinal directions are frequently used as selection and join criteria in query languages. However, most cardinal direction models are only able to h...
Tao Chen, Markus Schneider