Proceedings 14th International Conference on Data Engineering最新文献_第7页

Coarse indices for a tape-based data warehouse 用于基于磁带的数据仓库的粗索引

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655781

T. Johnson

{"title":"Coarse indices for a tape-based data warehouse","authors":"T. Johnson","doi":"10.1109/ICDE.1998.655781","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655781","url":null,"abstract":"Data warehouses allow users to make sense of large quantities of detail data. While most queries can be answered through summary data, some queries can only be answered by accessing the detail data. It is usually not cost-effective to store terabytes of detail data online; instead, the detail data is stored on tape. The problem we address in this paper is how to index tape-based detail data. Conventional indices on tens of terabytes of data can require terabytes of storage themselves. We propose the use of coarse indices for tape-based detail data. Instead of specifying all locations of a record containing a particular key, the coarse index specifies whether or not a region of tape contains at least one record with a particular key value. Our proposal is based on the observation that while long tape seeks are fast, short tape seeks are slow. Therefore, indices that point to the exact record location on tape do not provide performance benefits to justify the cost of their storage. A few bits pointing to an appropriate location are enough. In this paper, we present the design of such a coarse index, and provide fast algorithms for its updating and querying. Our experiments on a large data set taken from an existing data warehouse show that using compressed bitmap indices offer an order-of-magnitude reduction in index size, permitting the online storage of the coarse indices. Analytical and simulation models of the time to fetch selected records from tape show that using coarse indices almost always improves reduces the total loading time as compared to using dense tape-based indices or to using no index at all.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130948120","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

Cyclic allocation of two-dimensional data 二维数据循环分配

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655763

Sunil Prabhakar, K. Abdel-Ghaffar, D. Agrawal, A. E. Abbadi

引用次数: 76

Ending the ROLAP/MOLAP debate: usage based aggregation and flexible HOLAP 结束关于ROLAP/MOLAP的争论:基于使用的聚合和灵活的HOLAP

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655775

C. Salka

引用次数: 6

Remote load-sensitive caching for multi-server database systems 用于多服务器数据库系统的远程负载敏感缓存

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655814

S. Venkataraman, J. Naughton, M. Livny

引用次数: 13

Design and performance of an assertional concurrency control system 一个断言并发控制系统的设计与性能

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655806

A. Bernstein, D. S. Gerstl, Wai-Hong Leung, P. M. Lewis

引用次数: 12

SEMCOG: a hybrid object-based image database system and its modeling, language, and query processing SEMCOG:一个基于对象的混合图像数据库系统及其建模、语言和查询处理

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655788

Wen-Syan Li, K. Candan

引用次数: 15

Grouping techniques for update propagation in intermittently connected databases 间歇连接数据库中更新传播的分组技术

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655756

Sameer Mahajan, M. Donahoo, S. Navathe, M. Ammar, Sanjoy Malik

{"title":"Grouping techniques for update propagation in intermittently connected databases","authors":"Sameer Mahajan, M. Donahoo, S. Navathe, M. Ammar, Sanjoy Malik","doi":"10.1109/ICDE.1998.655756","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655756","url":null,"abstract":"We consider an environment where one or more servers carry databases that are of interest to a community of clients. The clients are only intermittently connected to the server for brief periods of time. Clients carry a part of the database for their own processing and accumulate local updates while disconnected. We call this the Intermittently Connected Database (ICDB) environment. ICDBs have a wide variety of applications including sales force automation, insurance claim processing, and mobile workforces. Our focus is on the problem of update propagation at the server in ICDBs and the associated processing at the clients. The typical client-centric approach involves the communication and processing of updates and transactions on a per-client basis, ignoring the overlap of data between clients. The complexity of this approach is in the order of the number of connecting clients, thereby limiting the scalability of the server. We propose a data-centric approach which clusters data into groups and assigns to each client one or more of these groups. The proposed scheme results in server processing complexity on the order of the number of groups, which we control. We propose various techniques for grouping and discuss the processing required at the clients to enable the grouping approach. While the client-centric approach is expected to significantly degrade with the increasing number of clients, we expect that a properly designed grouping scheme will sustain a number of clients that is significantly larger. A prototype has been developed and performance studies are in progress.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132468987","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}

引用次数: 28

Content-based multimedia information management 基于内容的多媒体信息管理

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655783

R. Jain

引用次数: 15

Messaging/queuing in Oracle8/sup TM/ Oracle8/sup TM/中的消息传递/队列

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655758

D. Gawlick

引用次数: 1

Parallelizing loops in database programming languages 数据库编程语言中的并行循环

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655762

D. Lieuwen

引用次数: 4