arousal
发表于 2025-3-25 07:00:00
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
发表于 2025-3-25 10:55:50
Database Programming Languages978-3-540-31445-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
真实的人
发表于 2025-3-25 14:15:11
http://reply.papertrans.cn/27/2634/263371/263371_23.png
acrobat
发表于 2025-3-25 19:21:52
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
发表于 2025-3-25 23:47:26
http://reply.papertrans.cn/27/2634/263371/263371_25.png
INCH
发表于 2025-3-26 00:59:27
http://reply.papertrans.cn/27/2634/263371/263371_26.png
GIST
发表于 2025-3-26 05:10:16
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.
轻快带来危险
发表于 2025-3-26 10:40:01
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.
权宜之计
发表于 2025-3-26 15:49:33
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.
去世
发表于 2025-3-26 16:53:44
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.