Titlebook: Database Programming Languages; 10th International S Gavin Bierman,Christoph Koch Conference proceedings 2005 Springer-Verlag Berlin Heidel

arousal

N-Ary Queries by Tree Automata,We investigate .-ary node selection queries in trees by successful runs of tree automata. We show that run-based .-ary queries capture MSO, contribute algorithms for enumerating answers of .-ary queries, and study the complexity of the problem. We investigate the subclass of run-based .-ary queries by unambiguous tree automata.

Choreography

Database Programming Languages978-3-540-31445-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

真實(shí)的人

acrobat

Lucid Dreaming in Western Literaturear, aggregate constraints defined as linear inequalities on aggregate-sum queries on input data are considered. The notion of repair as consistent set of updates at attribute-value level is exploited, and the characterization of several data-complexity issues related to repairing data and computing consistent query answers is provided.

cavity

INCH

GIST

https://doi.org/10.1007/978-981-10-7623-7ta conforming to a schema ., nor it can be used for effective query reformulation..This paper describes a novel technique for maintaining mappings in XML p2p databases, based on a . notion of mapping correctness.

輕快帶來危險(xiǎn)

Inside and Beyond the Human Cityion is represented by deterministic finite automata. We show that minimal UTAs in that class are not unique and that minimization is .-hard. We then study more recent automata classes that do allow for polynomial time minimization. Among those, we show that bottom-up deterministic stepwise tree automata yield the most succinct representations.

權(quán)宜之計(jì)

Mapping Maintenance in XML P2P Databases,ta conforming to a schema ., nor it can be used for effective query reformulation..This paper describes a novel technique for maintaining mappings in XML p2p databases, based on a . notion of mapping correctness.

去世

Minimizing Tree Automata for Unranked Trees,ion is represented by deterministic finite automata. We show that minimal UTAs in that class are not unique and that minimization is .-hard. We then study more recent automata classes that do allow for polynomial time minimization. Among those, we show that bottom-up deterministic stepwise tree automata yield the most succinct representations.