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

Persistent middle tier components without logging 没有日志记录的持久化中间层组件

9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.43

D. Lomet

引用次数: 4

Distribution-based synthetic database generation techniques for itemset mining 基于分布的项目集挖掘合成数据库生成技术

9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.22

G. Ramesh, Mohammed J. Zaki, W. Maniatty

{"title":"Distribution-based synthetic database generation techniques for itemset mining","authors":"G. Ramesh, Mohammed J. Zaki, W. Maniatty","doi":"10.1109/IDEAS.2005.22","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.22","url":null,"abstract":"The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used to benchmark performance of algorithms, tend to have distributions far different from those observed in real datasets. In this paper we focus on the problem of synthetic database generation and propose algorithms to effectively embed within the database, any given set of maximal pattern collections, and make the following contributions: 1. A database generation technique is presented which takes k maximal itemset collections as input, and constructs a database which produces these maximal collections as output, when mined at k levels of support. To analyze the efficiency of the procedure, upper bounds are provided on the number of transactions output in the generated database; 2. A compression method is used and extended to reduce the size of the output database. An optimization to the generation procedure is provided which could potentially reduce the number of transactions generated; 3. Preliminary experimental results are presented to demonstrate the feasibility of using the generation technique.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"52 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":"123783101","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}

引用次数: 19

Evaluation of integration of ACBL and AOCC caching algorithms ACBL和AOCC缓存算法集成的评价

9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.26

Yueping Lu, P. Bodorik, D. Jutla

{"title":"Evaluation of integration of ACBL and AOCC caching algorithms","authors":"Yueping Lu, P. Bodorik, D. Jutla","doi":"10.1109/IDEAS.2005.26","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.26","url":null,"abstract":"Transactional caching algorithms proposed for object database management systems (ODBMSs) have been classified into detection and avoidance categories, depending on whether they allow access to stale data. Although studies have shown that in most situations the leading detection-based algorithms tend to outperform those that use avoidance, most ODBMSs use a variation of the leading avoidance-based algorithm because detection algorithms in certain situations lead to abort rates that are unacceptable for some, typically interactive, applications. The Interoperable Server-side Caching (ISCT) algorithm allows both types of algorithms to interoperate in the same environment while being supported by an interoperable server. Clients use either the leading detection-based algorithm, called Adaptive Optimistic Concurrency Control (AOCC), or the leading avoidance-based algorithm, called Adaptive Call-Back Locking (ACBL). The caching operations of the client-side algorithms are not affected - only the server-side is adapted to interoperate with both types of clients. This paper presents the results of performance evaluation that compares the three algorithms under various loads. Evaluation shows that the interoperable server-side caching algorithm increases throughput in environments where some applications can use the high-throughput AOCC algorithm while other applications use a detection-based ACBL algorithm. To compare the algorithms a new workloads, in which different applications exhibit different server load characteristics, were developed.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"14 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":"116008271","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}

引用次数: 0

Design and evaluation of database layouts for MEMS-based storage systems 基于mems存储系统的数据库布局设计与评价

9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.18

J. Pisharath, W. Liao, A. Choudhary

引用次数: 1

A hierarchy navigation framework: supporting scalable interactive exploration over large databases 层次导航框架:支持在大型数据库上进行可伸缩的交互式探索

9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.5

N. K. Mehta, Elke A. Rundensteiner, M. Ward

{"title":"A hierarchy navigation framework: supporting scalable interactive exploration over large databases","authors":"N. K. Mehta, Elke A. Rundensteiner, M. Ward","doi":"10.1109/IDEAS.2005.5","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.5","url":null,"abstract":"Modern computer applications from business decision support to scientific data analysis use visualization techniques. However, visual exploration tools do not scale well for large data sets due to screen clutter. Visualization tools have thus been extended to support hierarchical views of the data, with support for focusing and drilling-down using interactive brushes. We now investigate how best to couple such a near real-time responsive visualization tool with database support. For this, we have developed a tree labeling method, called MinMax tree, that allows the movement of the on-line recursive processing of visual user interactions on hierarchical data sets into an off-line precomputation step. Using MinMax tree we map the recursive processing at the interface level to two dimensional range queries that can be answered efficiently using spatial indexes. We also employ caching and prefetching at the client side to cope with the real-time response requirements. The techniques have been incorporated into XmdvTool, a free software package for multi-variate data visualization and exploration. Our experimental results show 70% to 80% reduction in response time latency even with limited system resources.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"60 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":"125512699","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}

引用次数: 3

Semi-structured data management in the enterprise: a nimble, high-throughput, and scalable approach 企业中的半结构化数据管理:一种灵活、高吞吐量和可扩展的方法

9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.52

D. Maluf, D. Bell, N. Ashish, C. Knight, P. Tran

引用次数: 10

Detection for conflicts of dependencies in advanced transaction models 在高级事务模型中检测依赖冲突

9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.20

Tai Xin, I. Ray

{"title":"Detection for conflicts of dependencies in advanced transaction models","authors":"Tai Xin, I. Ray","doi":"10.1109/IDEAS.2005.20","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.20","url":null,"abstract":"Transactional dependencies play an important role in coordinating the execution of subtransactions in advanced transaction models, such as, nested transactions and workflow transactions. The correct execution of the advanced transactions depends on ensuring the satisfaction of all the dependencies, which are specified by the application developer. Incorrect specification of transaction dependencies might lead to information integrity problems and unavailability of resources. An example of incorrect specification of dependencies is the presence of conflicts - the satisfaction of constraints imposed by one dependency may violate the constraints imposed by another dependency. Algorithms that can analyze and detect dependency conflicts are necessary. Although a lot of research appears on advanced transactions, no previous work has been done on analysis of dependency conflicts. In this work, we analyze different kinds of dependency conflicts, propose algorithms to detect and remove the conflicts of dependencies in advanced transaction specifications. This will enable the application developer to get assurance about the correctness of the dependency specification and the correct behavior of the underlying advanced transaction model.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"47 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":"117144197","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

Hint and run: accelerating XPath queries 提示并运行:加速XPath查询

9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.33

I. Stanoi, Christian A. Lang, S. Padmanabhan

{"title":"Hint and run: accelerating XPath queries","authors":"I. Stanoi, Christian A. Lang, S. Padmanabhan","doi":"10.1109/IDEAS.2005.33","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.33","url":null,"abstract":"XML documents are often represented as DOM structures or trees. In some instances, due to the complexity of queries, XPath queries are better evaluated by traversing these structures rather than using summarization indexes. A requirement for the optimization of document navigation, is to efficiently decrease the number of traversed nodes. The optimization task is more difficult when the query framework allows a syntax that enlarges the search space, such as wildcards and descendant queries. To reduce the overhead of query processing, many database systems supporting XML rely on indexes. Such indexes are typically not able to adapt to memory restrictions or workload changes. A secondary data structure that uses little storage space and tunes itself to address hot spots in processing, can therefore be beneficial. In this paper, we propose a first method for creating, using, and maintaining selective signatures called hints to aid in the navigation of XML documents. Hints form a flexible data structure for pruning the search space, that can be used on its own or it can complement existing indexes. The amount of hints used is variable, and it depends on the storage limitation set a priori, and on the efficiency of the hints. Our experiments show that hints can improve the efficiency of navigational XML query processing by a large margin while using only little extra memory.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"12 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":"134224983","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

Evaluation of queries on tree-structured data using dimension graphs 使用维度图对树结构数据的查询进行评估

9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.27

Theodore Dalamagas, D. Theodoratos, Antonis Koufopoulos, Vincent Oria

{"title":"Evaluation of queries on tree-structured data using dimension graphs","authors":"Theodore Dalamagas, D. Theodoratos, Antonis Koufopoulos, Vincent Oria","doi":"10.1109/IDEAS.2005.27","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.27","url":null,"abstract":"The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of tree-structured data. Querying tree-structured data is a challenging issue due to the diversity of the structural aspect in the same or in different trees. In this paper, we show how to evaluate queries on tree-structured data, called value trees. The formulation of these queries does not depend on the structure of a particular value tree. Our approach exploits semantic information provided by dimension graphs. Dimension graphs are semantically rich constructs that abstract the structural information of the value trees. We show how dimension graphs can be used to query efficiently value trees in the presence of structural differences and irregularities. Value trees and their dimension graphs are represented as XML documents. We present a method for transforming queries to XPath expressions to be evaluated on the XML documents. We also provide conditions for identifying strongly and weakly unsatisfiable queries. Finally, we conducted various experiments to compare our method for evaluating queries with one that does not exploit dimension graphs. Our results demonstrate the superiority of our approach.","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":"131436669","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

An adaptive multi-objective scheduling selection framework for continuous query processing 面向连续查询处理的自适应多目标调度选择框架

9th International Database Engineering & Application Symposium (IDEAS'05) Pub Date : 2005-07-25 DOI: 10.1109/IDEAS.2005.9

Timothy M. Sutherland, Yali Zhu, L. Ding, Elke A. Rundensteiner

{"title":"An adaptive multi-objective scheduling selection framework for continuous query processing","authors":"Timothy M. Sutherland, Yali Zhu, L. Ding, Elke A. Rundensteiner","doi":"10.1109/IDEAS.2005.9","DOIUrl":"https://doi.org/10.1109/IDEAS.2005.9","url":null,"abstract":"Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing query throughput. We observe that different performance objectives may sometimes conflict with each other. Also due to the dynamic nature of streaming environments, the performance objective may need to change dynamically. Furthermore, the performance specification defined by users may itself be multi-dimensional. Therefore, utilizing a single scheduling algorithm optimized for a single objective is no longer sufficient. In this paper, we propose a novel adaptive scheduling algorithm selection framework named AMoS. It is able to leverage the strengths of existing scheduling algorithms to meet multiple performance objectives. AMoS employs a lightweight learning mechanism to assess the effectiveness of each algorithm. The learned knowledge can be used to select the algorithm that probabilistically has the best chance of improving the performance. In addition, AMoS has the flexibility to add and adapt to new scheduling algorithms, query plans and data sets during execution. Our experimental results show that AMoS significantly outperforms the existing scheduling algorithms with regard to satisfying both uni-objective and multi-objective performance requirements.","PeriodicalId":357591,"journal":{"name":"9th International Database Engineering & Application Symposium (IDEAS'05)","volume":"38 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":"123891086","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}

引用次数: 26