Sciweavers

50 search results - page 6 / 10
» Magic Sets for the XPath Language
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 12 days ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
KI
2004
Springer
15 years 5 months ago
Model Based Deduction for Database Schema Reasoning
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...
ICALP
2007
Springer
15 years 6 months ago
Bounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
Henrik Björklund, Mikolaj Bojanczyk
DOCENG
2006
ACM
15 years 6 months ago
Describing multistructured XML documents by means of delay nodes
Multistructured documents are documents whose structure is composed of a set of concurrent hierarchical structures. In this paper, we propose a new model of multistructured docume...
Jacques Le Maitre
SIGMOD
1993
ACM
93views Database» more  SIGMOD 1993»
15 years 4 months ago
Design and Implementation of the Glue-Nail Database System
We describe the design and implementation of the Glue-Nail database system. The Nail language is a purely declarative query language; Glue is a procedural language used for nonque...
Marcia A. Derr, Shinichi Morishita, Geoffrey Phipp...