发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Overcoming limitations of approximate query answering in OLAP 克服OLAP中近似查询应答的局限性
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.41
A. Cuzzocrea
{"title":"Overcoming limitations of approximate query answering in OLAP","authors":"A. Cuzzocrea","doi":"10.1109/IDEAS.2005.41","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.41","url":null,"abstract":"Two important limitations of approximate query answering in OLAP are recognized and investigated. These limitations are: (i) scalability of the techniques, i.e. their reliability on highly-dimensional data cubes; and (ii) need for guarantees on the degree of approximation of the answers. In this paper, we focus on the first limitation, and propose adopting the well-known Karhunen-Loeve transform (KLT) to obtain dimensionality reduction of data cubes, thus devising a transformation methodology that is independent by the number of dimensions of the data cubes. To tailor the KLT for the specific OLAP context, effective optimizations are also proposed, by taking into account the query-consciousness feature. Finally, some encouraging preliminary experimental results are presented.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"34 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":"126429238","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}
引用次数: 44
An integrated commit protocol for mobile network databases 移动网络数据库的集成提交协议
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.11
Joos-Hendrik Böse, S. Böttcher, L. Gruenwald, S. Obermeier, H. Schweppe, Thorsten Steenweg
{"title":"An integrated commit protocol for mobile network databases","authors":"Joos-Hendrik Böse, S. Böttcher, L. Gruenwald, S. Obermeier, H. Schweppe, Thorsten Steenweg","doi":"10.1109/IDEAS.2005.11","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.11","url":null,"abstract":"While traditional fixed-wired network protocols like 2-phase-commit guarantee atomicity, we cannot use them in mobile low bandwidth networks where network partitioning, node failure, and message loss may result in blocking. To deploy traditional database applications easily into a mobile environment, there is a demand for a protocol which guarantees an atomic commit of transactions. This paper introduces a protocol which can guarantee such atomic commitment in mobile environments using a combination of commit and consensus protocols. In addition, it takes advantage of mobile network sub-structures like single-hop environments to reduce message transfer costs.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"111 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":"132650493","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}
引用次数: 25
Nomadic Web service clients 游移式Web服务客户机
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.37
Kamal Elbashir, R. Deters
{"title":"Nomadic Web service clients","authors":"Kamal Elbashir, R. Deters","doi":"10.1109/IDEAS.2005.37","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.37","url":null,"abstract":"Mobile devices are emerging as an attractive platform for hosting Web service clients. But unlike their \"static\" counterparts, mobile devices are typically connected via a wireless network introducing novel challenges related to constrained bandwidth and the sudden loss of connectivity. To overcome these challenges we propose the use of a cache for SOAP traffic that will store request/response pairs. But unlike Web caches, a SOAP cache handles traffic that encodes communication of program logics, while the traffic handled by Web caches is initiated by user actions on generally static content. A SOAP cache requires metadata providing a clear distinction between state-based, and state-altering operations in order to support the client. This paper introduces the concept of an embedded SOAP cache, highlighting the need for meta-data as the means to support it. A novel SOAP cache (CRISP) that can be embedded into the client-side WS stack or used as standalone proxy-cache, is presented and evaluated under various loads and settings.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"91 43 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":"128822052","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}
引用次数: 1
Flexible update management in peer-to-peer database systems 灵活的对等数据库系统更新管理
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.31
D. Vecchio, S. Son
{"title":"Flexible update management in peer-to-peer database systems","authors":"D. Vecchio, S. Son","doi":"10.1109/IDEAS.2005.31","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.31","url":null,"abstract":"Promising the combination of dynamic configuration, scalability and redundancy, peer-to-peer (P2P) networks have garnered tremendous interest lately. Before long, this interest extended to P2P sharing of disparate databases. While many have explored the data placement and coordination difficulties involved in such systems, far fewer have examined the unique challenges involved in updating P2P-distributed data items. In addressing that problem, we present an adapted version of the traditional quorum-consensus approach that is better suited to the P2P domain. Further, we explore the many tradeoffs introduced by this flexible update scheme, especially in the areas of data freshness, data availability, access latency and redundancy. Our simulation results demonstrate that if the data replication or quorum levels are sufficiently high it is possible to achieve a near-zero probability of stale data access. However, since more nodes are involved in quorum-building, the cost of high data confidence is slower access times. Keeping with the flexibility theme, our philosophy is to leave control in the hands of individual peers, letting them choose parameters and tradeoff performance to meet their unique needs.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"104 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":"131622234","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}
引用次数: 13
Indexing relational database content offline for efficient keyword-based search 离线索引关系数据库内容以实现高效的基于关键字的搜索
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.36
Qi Su, J. Widom
{"title":"Indexing relational database content offline for efficient keyword-based search","authors":"Qi Su, J. Widom","doi":"10.1109/IDEAS.2005.36","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.36","url":null,"abstract":"Information retrieval systems such as Web search engines offer convenient keyword-based search interfaces. In contrast, relational database systems require the user to learn SQL and to know the schema of the underlying data even to pose simple searches. We propose an architecture that supports highly efficient keyword-based search over relational databases: A relational database is \"crawled\" in advance, text-indexing virtual documents that correspond to interconnected database content. At query time, the text index supports keyword-based searches with interactive response, identifying database objects corresponding to the virtual documents matching the query. Our system, EKSO, creates virtual documents from joining relational tuples and uses the DB2 Net Search Extender for indexing and keyword-search processing. Experimental results show that index size is manageable and database updates (which are propagated incrementally as recomputed virtual documents to the text index) do not significantly hinder query performance. We also present a user study confirming the superiority of keyword-based search over SQL for a range of database retrieval tasks.","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":"129510170","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}
引用次数: 73
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach 关系源上顺序敏感的XML查询处理:一种代数方法
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.40
Ling Wang, Song Wang, Brian Murphy, Elke A. Rundensteiner
{"title":"Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach","authors":"Ling Wang, Song Wang, Brian Murphy, Elke A. Rundensteiner","doi":"10.1109/IDEAS.2005.40","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.40","url":null,"abstract":"The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unordered relational data model, has not yet been adequately addressed. In this paper, we present a general approach for supporting order-sensitive XQuery-to-SQL translation that works irrespective of the chosen XML-to-relational data mapping and the selected order-encoding method. Our approach, called XSOT, utilizes an order-aware XML algebra representation. We propose order-sensitive rewriting rules at the algebraic level to eliminate the dependency of the order determining operators on the implicit XML view order. Furthermore, we introduce a series of order-sensitive optimization steps to transform the XML algebra tree for the purpose of efficient SQL translation. Lastly, we utilize a template-based approach using SQL-99 order features to generate SQL statements.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"134 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":"127372110","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}
引用次数: 10
Data updating between the operational and analytical databases through dw-log algorithm 通过dw-log算法实现操作数据库和分析数据库之间的数据更新
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.17
Bianka M. M. T. Gonçalves, I. C. Italiano, J. E. Ferreira
{"title":"Data updating between the operational and analytical databases through dw-log algorithm","authors":"Bianka M. M. T. Gonçalves, I. C. Italiano, J. E. Ferreira","doi":"10.1109/IDEAS.2005.17","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.17","url":null,"abstract":"Data warehouse systems (DWS) make use of storage techniques for efficient end user accessing and query facilities. DWS applications have implemented classic data synchronism operations that do not support an immediate data update. With the evolution of semantic data representation in the operational database environment, the accomplished analysis in DWS demands new synchronism ways. Hence, there is a growing interest in DWS that can rapidly absorb the operational database updates, without compromising the operational query processes. Our research aims at the characterization of the synchronous and asynchronous algorithms limits for data updating in a DWS. This research proposes another way for update propagations of asynchronous transactions in DWS, the dw-log algorithm. The dw-log algorithm implementation is supported by the process algebra approach.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"26 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":"125409097","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}
引用次数: 2
Using the lock manager to choose timestamps 使用锁管理器选择时间戳
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.53
D. Lomet, R. Snodgrass, Christian S. Jensen
{"title":"Using the lock manager to choose timestamps","authors":"D. Lomet, R. Snodgrass, Christian S. Jensen","doi":"10.1109/IDEAS.2005.53","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.53","url":null,"abstract":"Our goal is to support transaction-time functionality that enables the coexistence of ordinary, non-temporal tables with transaction-time tables. In such a system, each transaction updating a transaction-time or snapshot table must include a timestamp for its updated data that correctly reflects the serialization order of the transactions, including transactions on ordinary tables. A serious issue is coping with SQL CURRENT/spl I.bar/TIME functions, which should return a time consistent with a transaction's timestamp and serialization order. Prior timestamping techniques cannot support such junctions with this desired semantics. We show how to compatibly extend conventional database functionality for transaction-time support by exploiting the database system lock manager and by utilizing a spectrum of optimizations.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"70 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":"114245425","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}
引用次数: 17
Adaptive routing filters for robust query processing in schema-based P2P systems 基于模式的P2P系统中鲁棒查询处理的自适应路由过滤器
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.7
K. Hose, Marcel Karnstedt, K. Sattler, Ernst-August Stehr
{"title":"Adaptive routing filters for robust query processing in schema-based P2P systems","authors":"K. Hose, Marcel Karnstedt, K. Sattler, Ernst-August Stehr","doi":"10.1109/IDEAS.2005.7","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.7","url":null,"abstract":"Peer data management systems (PDMS) currently gain attention at an emerging scale in order to cope with the needs of growing organizational integration. Efficient query processing, as one of the main requirements in these systems, provides three major challenges: achieving robustness, scalability and self organization. In this paper we deal with the physical aspects of these requirements. We introduce an adaptive maintenance technique based on query feedback for keeping routing filters, used to optimize routing, up-to-date. These filters are applied in conjunction with an iterative query processing strategy and we show that this can improve robustness and scalability of query processing in distributed data management systems.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"202 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":"123036017","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}
引用次数: 9
Dynamic histograms for non-stationary updates 非平稳更新的动态直方图
9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.23
Elizabeth Lam, K. Salem
{"title":"Dynamic histograms for non-stationary updates","authors":"Elizabeth Lam, K. Salem","doi":"10.1109/IDEAS.2005.23","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.23","url":null,"abstract":"In this paper, we address the problem of incrementally maintaining a histogram in response to a non-stationary update process. In relational database systems, this problem can occur whenever relations model time-varying activities. We present a simple update model that is general enough to describe both stationary and non-stationary update processes, and we use it to show that existing histogram maintenance techniques can perform poorly when updates are non-stationary. We describe several techniques for solving this problem, and we use the update model to demonstrate that these techniques can effectively handle a broad range of update processes, including non-stationary ones.","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":"129726688","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}
引用次数: 2
首页 上一页 下一页 尾页
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学术官方微信