Titlebook: Database Theory - ICDT 2003; 9th International Co Diego Calvanese,Maurizio Lenzerini,Rajeev Motwani Conference proceedings 2003 Springer-Ve

違反

pulse-pressure

Ondines-curse

偶然

https://doi.org/10.1007/978-981-4560-55-9or which termination of query evaluation is decidable and which is more expressive than first-order logic over the reals. Furthermore, we can define a guarded fragment in which exactly the terminating queries of this language are expressible.

一大群

Processing XML Streams with Deterministic Automatand when it is constructed lazily. Our analysis indicates that, when the automaton is constructed lazily, and under certain assumptions about the structure of the input XML data, the number of states in the lazy DFA is manageable. We also validate experimentally our findings, on both synthetic and real XML data sets.

Conquest

manifestation

擴(kuò)音器

Data Exchange: Semantics and Query Answerings to compute a canonical universal solution efficiently.We adopt the notion of “certain answers” in indefinite databases for the semantics for query answering in data exchange. We investigate the computational complexity of computing the certain answers in this context and also study the problem of

Morose

On the Difficulty of Finding Optimal Relational Decompositions for XML Workloads: A Complexity Theor Our results suggest that, contrary to the trend in previous work, the eventual development of practical algorithms for finding relational decompositions for XML workloads will require judicious choices of cost models and translation algorithms, rather than an exclusive focus on the decomposition pr

MITE

Eugene Dairianathan,Chee-Hoo Lumo compute the aggregate of the weights of those input rectangles that overlap with the query rectangle. This result immediately improves a recent result on temporal-aggregate queries. Our indexing scheme can be dynamized and extended to higher dimensions. Finally, we demonstrate the practical effici