作者: 高腳酒杯 時(shí)間: 2025-3-21 21:37
978-3-540-30951-2Springer-Verlag Berlin Heidelberg 2005作者: CHANT 時(shí)間: 2025-3-22 01:35 作者: 火車車輪 時(shí)間: 2025-3-22 07:52 作者: 碎石頭 時(shí)間: 2025-3-22 12:40
https://doi.org/10.1007/978-981-10-7623-7. We have implemented a generic synchronization framework, called Harmony, that can be used to build statebased synchronizers for a wide variety of tree-structured data formats. A novel feature of this framework is that the synchronization process—in particular, the recognition of conflicts—is drive作者: 泥沼 時(shí)間: 2025-3-22 14:56 作者: 泥沼 時(shí)間: 2025-3-22 19:17 作者: 清醒 時(shí)間: 2025-3-22 22:53
Conscience: An Interdisciplinary Viewion is achieved by means of mappings among the peer schemas, rather than through a global schema. We propose a multi-modal epistemic semantics based on the idea that each peer is conceived as a rational agent that exchanges knowledge/belief with other peers, thus nicely modeling the modular structur作者: 忙碌 時(shí)間: 2025-3-23 02:50 作者: 可轉(zhuǎn)變 時(shí)間: 2025-3-23 06:05 作者: 機(jī)械 時(shí)間: 2025-3-23 13:29 作者: 松軟無力 時(shí)間: 2025-3-23 17:27
Categories of Objectors to Military ServiceQuery. We investigate the effect of omitting certain features of XQuery on the expressive power of the language. We start from a simple base fragment which can be extended by several optional features being aggregation functions such as count and sum, sequence generation, node construction, position作者: DEAWL 時(shí)間: 2025-3-23 19:09 作者: 使成波狀 時(shí)間: 2025-3-24 02:11 作者: CODA 時(shí)間: 2025-3-24 04:50
https://doi.org/10.1057/978-1-137-53805-5ocument is usually many times larger than the size of the document. A considerable amount of memory is needed to store the tree structure of the XML document. Here a technique is presented that allows to represent the tree structure of an XML document in an efficient way. The representation exploits作者: 十字架 時(shí)間: 2025-3-24 06:58 作者: 開始發(fā)作 時(shí)間: 2025-3-24 13:52 作者: Dissonance 時(shí)間: 2025-3-24 18:55
Inside and Beyond the Human Cityhat the database as a whole may fail to satisfy. Those answers are characterized as those that are invariant under minimal forms of restoring the consistency of the database. In this context, we study the problem of repairing databases by fixing integer numerical values at the attribute level with r作者: 拔出 時(shí)間: 2025-3-24 20:45
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 作者: Painstaking 時(shí)間: 2025-3-24 23:11 作者: arousal 時(shí)間: 2025-3-25 07: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 時(shí)間: 2025-3-25 10:55
Database Programming Languages978-3-540-31445-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 真實(shí)的人 時(shí)間: 2025-3-25 14:15 作者: acrobat 時(shí)間: 2025-3-25 19:21
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 時(shí)間: 2025-3-25 23:47 作者: INCH 時(shí)間: 2025-3-26 00:59 作者: GIST 時(shí)間: 2025-3-26 05:10
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) 時(shí)間: 2025-3-26 10:40
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ì) 時(shí)間: 2025-3-26 15:49
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.作者: 去世 時(shí)間: 2025-3-26 16:53
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.作者: 你正派 時(shí)間: 2025-3-26 23:37 作者: Herd-Immunity 時(shí)間: 2025-3-27 02:39
https://doi.org/10.1007/978-981-10-7623-7n by the schema of the structures being synchronized. We formalize Harmony’s synchronization algorithm, state a simple and intuitive specification, and illustrate how it can be used to synchronize trees representing a variety of specific forms of application data, including sets, records, and tuples.作者: 圓木可阻礙 時(shí)間: 2025-3-27 05:25
Categories of Objectors to Military Service information in for loops, and recursion. In this way we obtain 64 different XQuery fragments which can be divided into 17 different equivalence classes such that two fragments can express the same functions iff they are in the same equivalence class. Moreover, we investigate the relationships between these equivalence classes.作者: 使腐爛 時(shí)間: 2025-3-27 10:53 作者: 冒煙 時(shí)間: 2025-3-27 16:33 作者: 喧鬧 時(shí)間: 2025-3-27 18:21 作者: hysterectomy 時(shí)間: 2025-3-28 01:26
Dual Syntax for XML Languages,f a language. Given such a specification, the XSugar tool can translate from alternative syntax to XML and vice versa. Moreover, the tool statically checks that the transformations are reversible and that all XML documents generated from the alternative syntax are valid according to a given XML schema.作者: SSRIS 時(shí)間: 2025-3-28 03:19 作者: GLEAN 時(shí)間: 2025-3-28 08:25
Type-Based Optimization for Regular Patterns,e preliminary performance results. For a more fundamental analysis, we define an optimality criterion of “no useless tests” and show that it is not satisfied by .’s algorithm. We constructively demonstrate that the problem of generating optimal pattern matching code is decidable for finite (non-recursive) patterns.作者: 詞匯表 時(shí)間: 2025-3-28 12:05 作者: diathermy 時(shí)間: 2025-3-28 16:07
Exploiting Schemas in Data Synchronization,n by the schema of the structures being synchronized. We formalize Harmony’s synchronization algorithm, state a simple and intuitive specification, and illustrate how it can be used to synchronize trees representing a variety of specific forms of application data, including sets, records, and tuples.作者: 雜色 時(shí)間: 2025-3-28 19:24
On the Expressive Power of XQuery Fragments, information in for loops, and recursion. In this way we obtain 64 different XQuery fragments which can be divided into 17 different equivalence classes such that two fragments can express the same functions iff they are in the same equivalence class. Moreover, we investigate the relationships between these equivalence classes.作者: Biomarker 時(shí)間: 2025-3-29 02:05 作者: Femine 時(shí)間: 2025-3-29 06:44 作者: POLYP 時(shí)間: 2025-3-29 07:51
‘Collaborate’ or ‘Fragmentate’! annotation system on top of the host language’s types and propagate the annotations using ideas borrowed from affine type systems. We provide a type soundness proof with respect to an operational semantics of a Java core language.作者: 臭名昭著 時(shí)間: 2025-3-29 12:49
https://doi.org/10.1057/978-1-137-53805-5ies (and in particular, bulk operations) without prior decompression. For certain tasks like validation against an XML type or checking equality of documents, the representation allows for provably more efficient algorithms than those running on conventional representations.作者: Entirety 時(shí)間: 2025-3-29 17:48
Satisfiability of XPath Queries with Sibling Axes,ME and PSPACE in the absence of sibling axes, but that become NP-hard and EXPTIME-hard, respectively, when sibling axes are used instead of the corresponding vertical modalities (e.g., the wildcard and the descendant axis).作者: 不透氣 時(shí)間: 2025-3-29 22:00 作者: vertebrate 時(shí)間: 2025-3-30 01:24
A Type Safe DOM API, annotation system on top of the host language’s types and propagate the annotations using ideas borrowed from affine type systems. We provide a type soundness proof with respect to an operational semantics of a Java core language.作者: 空洞 時(shí)間: 2025-3-30 07:20 作者: 敏捷 時(shí)間: 2025-3-30 11:37
Patterns and Types for Querying XML Documents, by the database community, and regular expression patterns, mainly developed and studied in the programming language community. We think that the two approaches are complementary and should be both integrated in languages for XML, and we see in that an opportunity of collaboration between the two c作者: 刪減 時(shí)間: 2025-3-30 15:50 作者: 無辜 時(shí)間: 2025-3-30 19:04 作者: 運(yùn)氣 時(shí)間: 2025-3-30 23:52
Efficiently Enumerating Results of Keyword Search,g .-fragments. For a given set of keywords ., a .-fragment is a subtree . of the given data graph, such that . contains all the keywords of . and no proper subtree of . has this property. There are three types of .-fragments: rooted, undirected and strong. This paper describes the first provably eff作者: 反話 時(shí)間: 2025-3-31 03:59 作者: 卵石 時(shí)間: 2025-3-31 07:13 作者: 控制 時(shí)間: 2025-3-31 12:41
