Proceedings. International Database Engineering and Applications Symposium最新文献_第2页

Load balance for semantic cluster-based data integration systems 基于语义集群的数据集成系统的负载平衡

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513648

Edemberg Rocha da Silva, G. H. B. Souza, A. Salgado

引用次数: 1

On-the-fly generation of multidimensional data cubes for web of things 面向物联网的多维数据集动态生成

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513655

Muntazir Mehdi, Ratnesh Sahay, Wassim Derguech, E. Curry

引用次数: 16

Matching bounds for the all-pairs MapReduce problem 全对MapReduce问题的匹配边界

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513663

F. Afrati, J. Ullman

引用次数: 9

Near real-time with traditional data warehouse architectures: factors and how-to 接近实时的传统数据仓库架构:因素和操作方法

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513650

Nickerson Ferreira, P. Martins, P. Furtado

引用次数: 9

Content-based annotation and classification framework: a general multi-purpose approach 基于内容的注释和分类框架:一种通用的多用途方法

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513651

Michal Batko, Jan Botorek, Petra Budíková, P. Zezula

引用次数: 10

Evaluating skyline queries over vertically partitioned tables 评估垂直分区表上的skyline查询

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513647

J. Subero, Marlene Goncalves

引用次数: 0

Self-managing online partitioner for databases (SMOPD): a vertical database partitioning system with a fully automatic online approach 数据库的自管理在线分区器(SMOPD):一种垂直数据库分区系统，采用全自动在线方法

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513649

Liangzhe Li, L. Gruenwald

{"title":"Self-managing online partitioner for databases (SMOPD): a vertical database partitioning system with a fully automatic online approach","authors":"Liangzhe Li, L. Gruenwald","doi":"10.1145/2513591.2513649","DOIUrl":"https://doi.org/10.1145/2513591.2513649","url":null,"abstract":"A key factor of measuring database performance is query response time, which is dominated by I/O time. Database partitioning is among techniques that can help users reduce the I/O time significantly. However, how to efficiently partition tables in a database is not an easy problem, especially when we want to have this partitioning task done automatically by the system itself. This paper introduces an algorithm called Self-Managing Online Partitioner for Databases (SMOPD) in vertical partitioning based on closed item sets mining from a query set and system statistic information mined from system statistic views. This algorithm can dynamically monitor the database performance using user-configured parameters and automatically detect the performance trend so that it can decide when to perform a re-partitioning action without feedback from DBAs. This algorithm can free DBAs from the heavy tasks of keeping monitoring the system and struggling against the large statistic tables. The paper also presents the experimental results evaluating the performance of the algorithm using the TPC-H benchmark.","PeriodicalId":93615,"journal":{"name":"Proceedings. International Database Engineering and Applications Symposium","volume":"195 1","pages":"168-173"},"PeriodicalIF":0.0,"publicationDate":"2013-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75540753","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

Read optimisations for append storage on flash 读取优化附加存储在闪存上

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513640

R. Gottstein, Ilia Petrov, A. Buchmann

{"title":"Read optimisations for append storage on flash","authors":"R. Gottstein, Ilia Petrov, A. Buchmann","doi":"10.1145/2513591.2513640","DOIUrl":"https://doi.org/10.1145/2513591.2513640","url":null,"abstract":"Append-/Log-based Storage Managers (LbSM) for database systems represent a good match for the characteristics and behaviour of Flash technology. LbSM alleviate random writes reducing the impact of Flash read/write asymmetry, increasing endurance and performance. A recently proposed combination of Multi-Versioning database approaches and LbSM called SIAS [9] offers further benefits: it substantially lowers the write rate due to tuple version append granularity and therefore improves the performance. In SIAS a page contains versions of tuples of the same table. Once appended such a page is immutable. The only allowable operations are reads (lookups, scans, version visibility checks) in tuple version granularity. Optimising for them offers an essential performance increase. In the present work-in-progress paper we propose two types of read optimisations: Multi-Version Index and Ordered Log Storage.\u0000 Benefits of Ordered Log Storage: (i) Read efficiency due to the use of parallel read streams; (ii) Write efficiency since larger amounts of data are appended sequentially; (iii) fast garbage collection: read multiple sorted runs, filter dead tuples and write one single, large (combined) sorted run. (iv) possible cache-efficiency optimisations (for large scans)\u0000 Benefits of Multi-Version Indexing: (i) index only visibility checks; (ii) postponing of index reorganisations; (iii) no invalid tuple bits in the index (in-place updates); (iv) pre-filtering of invisible tuple versions; (v) facilitate easy identification of tuple versions to be garbage collected.\u0000 Benefits of the combination of both approaches: (i) Index and ordered access; (ii) Facilitate range searches in sorted runs; (iii) on the fly garbage collection (checking of one bit).","PeriodicalId":93615,"journal":{"name":"Proceedings. International Database Engineering and Applications Symposium","volume":"65 1","pages":"106-113"},"PeriodicalIF":0.0,"publicationDate":"2013-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80386698","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}

引用次数: 4

Breaking skyline computation down to the metal: the skyline breaker algorithm 将天际线计算分解为金属:天际线破坏者算法

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513637

D. Köppl

引用次数: 4

Verification of k-coverage on query line segments 查询线段上k-coverage的验证

Proceedings. International Database Engineering and Applications Symposium Pub Date : 2013-10-09 DOI: 10.1145/2513591.2513639

Kun-Han Juang, En Tzu Wang, Chieh-Feng Chiang, Arbee L. P. Chen

{"title":"Verification of k-coverage on query line segments","authors":"Kun-Han Juang, En Tzu Wang, Chieh-Feng Chiang, Arbee L. P. Chen","doi":"10.1145/2513591.2513639","DOIUrl":"https://doi.org/10.1145/2513591.2513639","url":null,"abstract":"The coverage problem is one of the fundamental problems in sensor networks, which reflects the degree of a region being monitored by sensors. In this paper, we make the first attempt to address the k-coverage verification problem regarding a given query line segment, which returns all sub-segments from the line segment that are covered by at least k sensors. To deal with the problem, we propose three methods based on the R-tree index. The first method is the most primitive one, which identifies all intersection points of the query line segment and the circumferences of the covering regions of the sensors and then checks each sub-segment to see whether it is k-coverage. Improving from the first method, the second method calculates the lower bound of the number of sensors covering a specific sub-segment to reduce the computation costs. The third method partitions the query line segment into sub-segments with equal length and then verifies each of them. A series of experiments on a real dataset and two synthetic datasets are performed to evaluate these methods. The experiment results demonstrate that the third method has the best performance among all three methods.","PeriodicalId":93615,"journal":{"name":"Proceedings. International Database Engineering and Applications Symposium","volume":"192 1","pages":"114-121"},"PeriodicalIF":0.0,"publicationDate":"2013-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74197649","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