標(biāo)題: Titlebook: Database and XML Technologies; 5th International XM Denilson Barbosa,Angela Bonifati,Rainer Unland Conference proceedings 2007 Springer-Ver [打印本頁] 作者: 誤解 時間: 2025-3-21 18:57
書目名稱Database and XML Technologies影響因子(影響力)
書目名稱Database and XML Technologies影響因子(影響力)學(xué)科排名
書目名稱Database and XML Technologies網(wǎng)絡(luò)公開度
書目名稱Database and XML Technologies網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Database and XML Technologies被引頻次
書目名稱Database and XML Technologies被引頻次學(xué)科排名
書目名稱Database and XML Technologies年度引用
書目名稱Database and XML Technologies年度引用學(xué)科排名
書目名稱Database and XML Technologies讀者反饋
書目名稱Database and XML Technologies讀者反饋學(xué)科排名
作者: ODIUM 時間: 2025-3-21 20:34 作者: frivolous 時間: 2025-3-22 01:19
Sam Laird,Santiago Fernández de Córdobas into expressions with as few query blocks as possible..Our toolkit takes the form of rewrite rules merging the inner and outer FLWOR expressions into single FLWORs. We focus on previously unpublished rewrite rules and on inner FLWORs occurring in the ., ., and . clauses in the outer FLWOR.作者: Graduated 時間: 2025-3-22 06:25
Adjustment Costs and Trade Liberalizationnot well-supported yet. The evaluation technique proposed in this paper is able to handle duplicate removal in the partitions efficiently. Experiments show the superiority of our solution compared to state-of-the-art query processing.作者: pineal-gland 時間: 2025-3-22 10:29
Santiago Fernández de Córdoba,David Vanzettibe valid for the original schema, for an updated schema. Then, we enhance the approach to adapt the documents to the new schema. Experiments prove that our approach increases the performance of standard validation algorithms in this setting and that the cost of the adaptation process is limited.作者: 防水 時間: 2025-3-22 13:45
Santiago Fernández de Córdoba,David Vanzettien read-only and update transactions. Moreover, SXDGL takes into account the hierarchical structure and semantics of XML data model determining conflicts between concurrent XML-operations of update transactions. The conducted evaluation shows significant benefits of SXDGL for processing concurrent transactions in data-intensive XML-applications.作者: 防水 時間: 2025-3-22 17:26 作者: cruise 時間: 2025-3-22 21:38
https://doi.org/10.1057/9780230377806s. A key challenge is the efficient execution of integration workflows and their query and matching steps at runtime. We relate mashup data integration with other approaches, list major challenges, and outline features of a first prototype design.作者: 萬靈丹 時間: 2025-3-23 01:38
Let a Single FLWOR Blooms into expressions with as few query blocks as possible..Our toolkit takes the form of rewrite rules merging the inner and outer FLWOR expressions into single FLWORs. We focus on previously unpublished rewrite rules and on inner FLWORs occurring in the ., ., and . clauses in the outer FLWOR.作者: Melatonin 時間: 2025-3-23 06:39 作者: 改正 時間: 2025-3-23 13:41
XML Schema Evolution: Incremental Validation and Efficient Document Adaptationbe valid for the original schema, for an updated schema. Then, we enhance the approach to adapt the documents to the new schema. Experiments prove that our approach increases the performance of standard validation algorithms in this setting and that the cost of the adaptation process is limited.作者: 提名的名單 時間: 2025-3-23 15:00
SXDGL: Snapshot Based Concurrency Control Protocol for XML Dataen read-only and update transactions. Moreover, SXDGL takes into account the hierarchical structure and semantics of XML data model determining conflicts between concurrent XML-operations of update transactions. The conducted evaluation shows significant benefits of SXDGL for processing concurrent transactions in data-intensive XML-applications.作者: HAWK 時間: 2025-3-23 19:34
Coping with Selfishness in Congestion Gamesc properties of the model itself. We present such an approach, based on Shannon’s information theory, and show how it applies to relational normal forms as well as to XML design, for both native and relational storage.作者: Assignment 時間: 2025-3-23 23:01 作者: NICE 時間: 2025-3-24 02:46 作者: 巡回 時間: 2025-3-24 07:57 作者: 敲竹杠 時間: 2025-3-24 11:17
Santiago Fernández de Córdoba,David Vanzettid being .. Then we concentrate on the satisfiability problem of XPath queries under such DTDs. We obtain a number of XPath fragments for which the complexity of the satisfiablity problem reduces to PTIME when such real-world DTDs are used.作者: CHANT 時間: 2025-3-24 17:06
Santiago Fernández de Córdoba,David Vanzettired our technique to a timestamped XML solution and a set of Web services has been developed. The easy management of multiple versioning, the large number of queries in different XML standard query languages and its implementation by using only XML technology, are some of the advantages of the proposed technique.作者: 死亡率 時間: 2025-3-24 20:26
Robust Design of Networks Under Risksh, schema matching has impact on numerous applications. It impacts business, where company data sources continuously realign due to changing markets. It also impacts life sciences, where scientific workflows cross system boundaries more often than not.作者: indemnify 時間: 2025-3-25 02:51 作者: 清洗 時間: 2025-3-25 03:50
Managing Branch Versioning in Versioned/Temporal XML Documentsred our technique to a timestamped XML solution and a set of Web services has been developed. The easy management of multiple versioning, the large number of queries in different XML standard query languages and its implementation by using only XML technology, are some of the advantages of the proposed technique.作者: GIDDY 時間: 2025-3-25 11:12
The Generation Y of XML Schema Matching Panel Descriptionh, schema matching has impact on numerous applications. It impacts business, where company data sources continuously realign due to changing markets. It also impacts life sciences, where scientific workflows cross system boundaries more often than not.作者: 盡管 時間: 2025-3-25 15:44
Normalization Theory for XMLations, not all are good – some are prone to redundancies and update anomalies. In the relational world we have a well-developed theory of data design (also known as normalization). A few definitions of XML normal forms have been proposed, but the main question is . a particular design is good. In t作者: 骯臟 時間: 2025-3-25 18:14 作者: ULCER 時間: 2025-3-25 20:02
XPath Query Satisfiability is in PTIME for Real-World DTDse is some document valid with respect to . on which . returns a nonempty result. Recent studies in the literature have shown the problem to be NP-hard or worse for most fragments of XPath. However, in this paper we show that the satisfiability problem is in PTIME for most DTDs used in real-world app作者: 胖人手藝好 時間: 2025-3-26 02:54 作者: Lamina 時間: 2025-3-26 08:23 作者: 修飾 時間: 2025-3-26 12:14
Efficient XQuery Evaluation of Grouping Conditions with Duplicate Removalsuery language. As users integrate this new construct into their applications, it becomes important to have efficient evaluation techniques available to process even complex grouping conditions. Among them, the removal of distinct values or distinct nodes in the partitions defined by the . clause is 作者: 奴才 時間: 2025-3-26 16:01
On the Effectiveness of Flexible Querying Heuristics for XML Dataelevant proposals employs heuristics that identify groups of meaningfully related nodes using information extracted from the input data. These heuristics are employed to effectively prune the search space of all possible node combinations and their popularity is evident by the large number of such h作者: asthma 時間: 2025-3-26 17:14
XML Schema Evolution: Incremental Validation and Efficient Document Adaptationuments. XML Schemas, however, may need to be updated to adhere to new requirements and to face changes in the application domain. Starting from a set of schema modification primitives, in this paper we devise an incremental validation approach that allows to efficiently validate documents, known to 作者: 閃光你我 時間: 2025-3-27 00:11 作者: LVAD360 時間: 2025-3-27 01:34
SXDGL: Snapshot Based Concurrency Control Protocol for XML Datased methods are based on the two-phase locking protocol, which potentially leads to a high blocking rates in data-intensive XML-applications. In this paper we present and evaluate SXDGL, a new snapshot based concurrency control protocol for XML data. SXDGL completely eliminates data contention betwe作者: Freeze 時間: 2025-3-27 08:51
The Generation Y of XML Schema Matching Panel Description and XML Schemata). Schema matching is recognized to be one of the basic operations required by the process of data integration [3], and thus has a great impact on its outcome. Schema mappings (the outcome of the matching process) can serve in tasks of generating global schemata, query rewriting ove作者: 欲望小妹 時間: 2025-3-27 11:00
0302-9743 of Normalization Theory for XML, while Erhard Rahm (University of Leipzig, Germany) contributed an interesting overview of the work on Dynamic Fusion of Web Dat978-3-540-75287-5978-3-540-75288-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 范圍廣 時間: 2025-3-27 13:46
On the Effectiveness of Flexible Querying Heuristics for XML Data heuristics and show how each heuristic addresses this problem. We then identify data categories where the assumptions made by each heuristic are valid and draw insights on their possible effectiveness. Our findings can help systems implementors understand the strengths and weaknesses of each heuris作者: 搖擺 時間: 2025-3-27 19:01 作者: 一個攪動不安 時間: 2025-3-28 01:21 作者: 甜得發(fā)膩 時間: 2025-3-28 03:56
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263519.jpg作者: 精確 時間: 2025-3-28 09:23
https://doi.org/10.1007/978-3-540-75288-2Extensible Markup Language (XML); Fusion; OVal; Session; XML; XML query processing; XML-relational q; concu作者: SCORE 時間: 2025-3-28 14:17 作者: 教義 時間: 2025-3-28 17:58 作者: Pamphlet 時間: 2025-3-28 19:03
Coping with Selfishness in Congestion Gamesations, not all are good – some are prone to redundancies and update anomalies. In the relational world we have a well-developed theory of data design (also known as normalization). A few definitions of XML normal forms have been proposed, but the main question is . a particular design is good. In t作者: ostracize 時間: 2025-3-29 02:24 作者: 剝皮 時間: 2025-3-29 04:37
Santiago Fernández de Córdoba,David Vanzettie is some document valid with respect to . on which . returns a nonempty result. Recent studies in the literature have shown the problem to be NP-hard or worse for most fragments of XPath. However, in this paper we show that the satisfiability problem is in PTIME for most DTDs used in real-world app作者: VOC 時間: 2025-3-29 09:16
https://doi.org/10.1057/9780230377806e XPath queries effectively on increasingly larger web collections containing hundreds of thousands of XML documents. Even when tasks only need to deal with a single document at a time, developers benefit from understanding the behaviour of XPath expressions across multiple documents (e.g., what wil作者: 除草劑 時間: 2025-3-29 13:51
Sam Laird,Santiago Fernández de Córdobatures, the unit of plan generation is the query block. Fewer query blocks mean a larger search space for the plan generator and lead to a generally higher quality of the execution plans. The goal of this paper is to provide a toolkit for developers of XQuery evaluators to transform XQuery expression作者: EWER 時間: 2025-3-29 15:59
Adjustment Costs and Trade Liberalizationuery language. As users integrate this new construct into their applications, it becomes important to have efficient evaluation techniques available to process even complex grouping conditions. Among them, the removal of distinct values or distinct nodes in the partitions defined by the . clause is 作者: 胰臟 時間: 2025-3-29 19:48
Sam Laird,Santiago Fernández de Córdobaelevant proposals employs heuristics that identify groups of meaningfully related nodes using information extracted from the input data. These heuristics are employed to effectively prune the search space of all possible node combinations and their popularity is evident by the large number of such h作者: corpus-callosum 時間: 2025-3-30 00:32
Santiago Fernández de Córdoba,David Vanzettiuments. XML Schemas, however, may need to be updated to adhere to new requirements and to face changes in the application domain. Starting from a set of schema modification primitives, in this paper we devise an incremental validation approach that allows to efficiently validate documents, known to 作者: 形上升才刺激 時間: 2025-3-30 06:28
