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

Industry applications of data mining: challenges and opportunities 数据挖掘的行业应用:挑战与机遇

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

Evangelos Simoudis

引用次数: 1

DB-MAN: a distributed database system based on database migration in ATM networks DB-MAN: ATM网络中基于数据库迁移的分布式数据库系统

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

T. Hara, K. Harumoto, M. Tsukamoto, S. Nishio

{"title":"DB-MAN: a distributed database system based on database migration in ATM networks","authors":"T. Hara, K. Harumoto, M. Tsukamoto, S. Nishio","doi":"10.1109/ICDE.1998.655815","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655815","url":null,"abstract":"Because of the recent development of network technologies such as ATM (Asynchronous Transfer Mode), broader channel bandwidth is becoming available everywhere in the world wide networks. As one of the new technologies to make good use of such broadband channel, dynamic relocation of databases through networks, which we call database migration, will soon become a powerful and basic database operation of practical use. We discuss our proposal of a distributed database system, DB-MAN (distributed database system based on DataBase Migration in ATM Networks), which takes advantage of database migration in virtual LANs (local area networks) of ATM networks. DB-MAN has two notable mechanisms: a mechanism for selecting the transaction processing method and a mechanism for concurrency control with database migration. The former, is a mechanism which chooses the more efficient method between two transaction processing methods: the conventional method based on the two phase commit protocol and our method employing database migration. The latter is a mechanism to prevent the transaction processing throughput from deteriorating in environments where data contention is a significant factor. Then we show simulation results regarding performance comparison between our proposed system and the conventional distributed database system based on the two phase commit protocol. The obtained results demonstrate that effective use of database migration gives higher performance than that of the conventional system.","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":"129467762","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}

引用次数: 15

Persistent applications using generalized redo recovery 使用广义重做恢复的持久应用程序

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

D. Lomet

引用次数: 20

On querying spreadsheets 关于查询电子表格

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

L. Lakshmanan, Iyer N. Subramanian, N. Goyal, R. Krishnamurthy

{"title":"On querying spreadsheets","authors":"L. Lakshmanan, Iyer N. Subramanian, N. Goyal, R. Krishnamurthy","doi":"10.1109/ICDE.1998.655769","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655769","url":null,"abstract":"Considers the problem of querying the data in applications such as spreadsheets and word processors. This problem has several motivations from the perspective of data integration, interoperability and OLAP. We provide an architecture for realizing interoperability among such diverse applications and address the challenges that arise specifically in the context of querying data stored in spreadsheet applications. A fundamental challenge is the lack of a well-defined schema. We propose a framework in which the user can specify the layout of data in a spreadsheet, based on his perception of the important concepts underlying that data. Layout specifications can be viewed as the \"physical schema\" of a spreadsheet. We motivate the concept of an abstract database machine (ADM) that uses the layout specifications to provide a relational view of the data in spreadsheet applications and, similar to a DBMS, supports efficient querying of the spreadsheet data. We develop a methodology for building ADMs for spreadsheets and describe our implementation of an ADM for Microsoft Excel applications, based on the above methodology. Our implementation platform is IBM PCs running Windows NT, Microsoft Office and OLE 2.0. We demonstrate the generality and practicality of our approach by developing a formal characterization of the class of spreadsheets that can be handled in our framework. Our results show that the approach is capable of handling a broad class of naturally occurring spreadsheet applications. This work is part of an office tool integration project.","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":"131003815","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

The Alps at your fingertips: virtual reality and geoinformation systems 触手可及的阿尔卑斯山:虚拟现实和地理信息系统

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

R. Pajarola, T. Ohler, P. Stucki, Kornel Szabo, P. Widmayer

引用次数: 23

Point-versus interval-based temporal data models 基于点与间隔的时间数据模型

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

Michael H. Böhlen, Renato Busatto, Christian S. Jensen

{"title":"Point-versus interval-based temporal data models","authors":"Michael H. Böhlen, Renato Busatto, Christian S. Jensen","doi":"10.1109/ICDE.1998.655777","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655777","url":null,"abstract":"The association of timestamps with various data items such as tuples or attribute values is fundamental to the management of time varying information. Using intervals in timestamps, as do most data models, leaves a data model with a variety of choices for giving a meaning to timestamps. Specifically, some such data models claim to be point based while other data models claim to be interval based. The meaning chosen for timestamps is important it has a pervasive effect on most aspects of a data model, including database design, a variety of query language properties, and query processing techniques, e.g., the availability of query optimization opportunities. The paper precisely defines the notions of point based and interval based temporal data models, thus providing a new formal basis for characterizing temporal data models and obtaining new insights into the properties of their query languages. Queries in point based models treat snapshot equivalent argument relations identically. This renders point based models insensitive to coalescing. In contrast, queries in interval based models give significance to the actual intervals used in the timestamps, thus generally treating non identical, but possibly snapshot equivalent relations differently. The paper identifies the notion of time fragment preservation as the essential defining property of an interval based data model.","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":"129580338","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}

引用次数: 112

Performance analysis of parallel hash join algorithms on a distributed shared memory machine implementation and evaluation on HP exemplar SPP 1600 并行哈希连接算法在分布式共享内存机上的性能分析，在HP范例spp1600上的实现与评估

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

M. Nakano, H. Imai, M. Kitsuregawa

{"title":"Performance analysis of parallel hash join algorithms on a distributed shared memory machine implementation and evaluation on HP exemplar SPP 1600","authors":"M. Nakano, H. Imai, M. Kitsuregawa","doi":"10.1109/ICDE.1998.655761","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655761","url":null,"abstract":"The distributed shared memory (DSM) architecture is considered to be one of the most likely parallel computing environment candidate for the near future because of its ease of system scalability and facilitation for parallel programming. However, a naive program based on shared memory execution on a DSM machine often deteriorates performance, because of the overhead involved for maintaining cache coherency particularly with frequent remote memory accesses. We show that careful buffer management of parallel join processing on DSM can produce considerable performance improvements in comparison with a naive implementation. We propose four buffer management strategies for parallel hash join processing on the DSM architecture and actually implement them on the HP Exemplar SPP 1600. The basic strategy is to begin with the hash join algorithm for the shared everything architecture and then to consider the memory locality of DSM by distributing the hash table and data pool buffers among the nodes. The results of four buffering strategies are analyzed in detail. Consequently, we can conclude that, in order to achieve high performance on a DSM machine, our buffer management strategy in which the memory access pattern is extracted and buffers are allocated in the local memory of nodes to minimize memory access cost is very efficient.","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":"128561130","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

Methodical restructuring of complex workflow activities 复杂工作流活动的系统重构

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

Ling Liu, C. Pu

引用次数: 39

Representing and querying changes in semistructured data 表示和查询半结构化数据中的更改

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

S. Chawathe, S. Abiteboul, J. Widom

引用次数: 147

Employing intelligent agents for knowledge discovery 利用智能代理进行知识发现

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

Earl Stahl

引用次数: 3