9th International Database Engineering & Application Symposium (IDEAS'05)最新文献

筛选
英文 中文
Fault-tolerance in distributed query processing 分布式查询处理中的容错
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.29
Jim Smith, P. Watson
{"title":"Fault-tolerance in distributed query processing","authors":"Jim Smith, P. Watson","doi":"10.1109/IDEAS.2005.29","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.29","url":null,"abstract":"Fault-tolerance has long been a feature of database systems, with transactions supporting the structuring of applications so as to ensure continuation of updating applications in spite of machine failures. For read-only queries the perceived wisdom has been that support for fault-tolerance is too expensive to be worthwhile. Distributed query processing is coming to be seen as a promising way of implementing applications that combine structured data and analysis operations in dynamic distributed settings such as computational grids. Such a query may be long-running and having to redo the whole query after a failure may cause problems (e.g. if the result may trigger business or safety critical activities). This work describes and evaluates a new scheme for adding fault-tolerance to distributed query processing through a rollback-recovery mechanism. The high level expression of user requests in a physical algebra offers opportunities for tuning the fault-tolerance provision so as to reduce the cost, and give better performance than employment of generic fault-tolerance mechanisms at the lowest level of query processing. This paper outlines how the publicly-available OGSA-DQP computational grid-based distributed query processing system can be modified to include support for fault-tolerance and presents a performance evaluation which includes measurements of the cost of both protocol overheads and rollback-recovery, for a set of example distributed queries.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124213063","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 33
Querying with negation in data integration systems 数据集成系统中的否定查询
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.47
Z. Majkic
{"title":"Querying with negation in data integration systems","authors":"Z. Majkic","doi":"10.1109/IDEAS.2005.47","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.47","url":null,"abstract":"Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. It is characterized by an architecture based on a global schema, with the set of integrity constraints, and a set of sources. In this paper, we investigate the way in which Closed World Assumption on a source data base can be coherently propagated to the global schema. The problem to resolve is directly connected by the fact that a global schema has a number (possibly infinite) of minimal models, caused by the incompleteness of source databases w.r.t. the integrity constraints over global schema. The aim of this preliminary work is to open the perspective for query language with negation in data integration framework.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115324158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Utilizing indexes for approximate and on-line nearest neighbor queries 利用索引进行近似查询和联机最近邻查询
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.54
King-Ip Lin, Michael Nolen, Koteswara Kommeneni
{"title":"Utilizing indexes for approximate and on-line nearest neighbor queries","authors":"King-Ip Lin, Michael Nolen, Koteswara Kommeneni","doi":"10.1109/IDEAS.2005.54","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.54","url":null,"abstract":"We explore using index structures for effective approximate and on-line nearest neighbor queries. While many index structures have showed to suffer from the dimensionality curse, we believe that indexes can still be useful in providing quick approximate solutions to the nearest neighbor queries. Moreover, the information provided by the indexes can provide certain bounds that can be invaluable for on-line nearest neighbor queries. This paper explores the idea of applying current R-tree based indexes to approximate and on-line nearest neighbors with bounds. We experiment with various heuristics and compare the trade-off between accuracy and efficiency. Our results are compared to locality sensitive hashing (LSH) and they show the effectiveness of the proposed scheme. We also provide guidelines on how this can be useful in a practical sense.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116451482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Incremental fusion of XML fragments through semantic identifiers 通过语义标识符增量融合XML片段
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.34
M. El-Sayed, Elke A. Rundensteiner, Murali Mani
{"title":"Incremental fusion of XML fragments through semantic identifiers","authors":"M. El-Sayed, Elke A. Rundensteiner, Murali Mani","doi":"10.1109/IDEAS.2005.34","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.34","url":null,"abstract":"Many applications, like materialized view maintenance and stream query processing, construct views incrementally over data sources. This results in computed pieces of objects that need to be merged by fusing corresponding objects together. This problem is challenging when dealing with XML data for many reasons including the hierarchical and semi-structured nature of XML data. Also XML query languages (e.g., XQuery) are capable of performing complex operations and transformations such as arbitrary nesting and result reconstruction. Moreover, since XML is an ordered data model, XML order has to be taken into consideration when constructing XML results incrementally. In this paper we study the problem of how to fuse XML pieces (fragments) generated by incrementally processing XML data into XML results. We consider an expressive subset of XQuery language transformations and propose an id-based solution for this problem that supports XML order. We prove the correctness of our approach, in particular that using our mechanism we can correctly yet incrementally merge XML result fragments. We have implemented our proposed semantic identifiers solution. Our experimental results show that it comes with a very small overhead to the query execution time.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126785926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信