Proceedings 14th International Conference on Data Engineering最新文献

Network latency optimizations in distributed database systems 分布式数据库系统中的网络延迟优化

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

S. Banerjee, Panos K. Chrysanthis

{"title":"Network latency optimizations in distributed database systems","authors":"S. Banerjee, Panos K. Chrysanthis","doi":"10.1109/ICDE.1998.655816","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655816","url":null,"abstract":"The advent of high-speed networks will enable the deployment of data-server systems (currently used in LANs) over WANs. The users of these systems will have the same high expectations with respect to performance parameters (such as the transaction throughput, response time and system reliability) as in the case of LANs. Thus, it is important to study the performance of existing distributed database protocols in the new networking environment, identify the performance bottlenecks and develop protocols that are capable of taking advantage of the high-speed networking technology. As a first step, in this paper, we examine the scalability of the server-based two-phase locking (s-2PL) protocol, and discuss three optimizations which allow the s-2PL protocol to be tailored for high-speed WAN environments where the size of the message is less of a concern than the number of rounds of message passing. These optimizations, collectively called the group two-phase locking (g-2PL) protocol, reduce the number of rounds of message passing by grouping lock grants, client-end caching and data migration. In a simulation study, 20-25% improvement in the response time of the g-2PL protocol over that of the s-2PL protocol was observed.","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":"125393159","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

Data logging: a method for efficient data updates in constantly active RAIDs 数据记录:一种在持续活跃的raid中有效更新数据的方法

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

E. Gabber, H. F. Korth

引用次数: 20

Design and implementation of display specification for multimedia answers 多媒体答题显示规范的设计与实现

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

Chitta Baral, G. Gonzalez, Tran Cao Son

引用次数: 13

High dimensional similarity joins: algorithms and performance evaluation 高维相似连接:算法和性能评价

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

Nick Koudas, K. Sevcik

{"title":"High dimensional similarity joins: algorithms and performance evaluation","authors":"Nick Koudas, K. Sevcik","doi":"10.1109/ICDE.1998.655809","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655809","url":null,"abstract":"Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing rely on a transformation of data elements into points in a multidimensional feature space. Indexing and query processing then take place in the feature space. We study algorithms for finding relationships among points in multidimensional feature spaces, specifically algorithms for multidimensional joins. Like joins of conventional relations, correlations between multidimensional feature spaces can offer valuable information about the data sets involved. We present several algorithmic paradigms for solving the multidimensional join problem, and we discuss their features and limitations. We propose a generalization of the Size Separation Spatial Join algorithm, named Multidimensional Spatial Join (MSJ), to solve the multidimensional join problem. We evaluate MSJ along with several other specific algorithms, comparing their performance for various dimensionalities on both real and synthetic multidimensional data sets. Our experimental results indicate that MSJ, which is based on space filling curves, consistently yields good performance across a wide range of dimensionalities.","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":"128593827","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}

引用次数: 121

Fast nearest neighbor search in high-dimensional space 高维空间的快速近邻搜索

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

Stefan Berchtold, Bernhard Ertl, D. Keim, H. Kriegel, T. Seidl

引用次数: 173

A graphical editor for the conceptual design of business rules 用于业务规则概念设计的图形化编辑器

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

Peter Lang, W. Obermair, W. Kraus, T. Thalhammer

{"title":"A graphical editor for the conceptual design of business rules","authors":"Peter Lang, W. Obermair, W. Kraus, T. Thalhammer","doi":"10.1109/ICDE.1998.655824","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655824","url":null,"abstract":"At the conceptual level, business rules are formulated from an external observation perspective according to the event-condition-action structure of rules in active database systems. Situation/activation diagrams homogeneously extend object/behavior diagrams to a graphical notation for the conceptual design of business objects and their associated business rules. Situation diagrams provide a high-level representation of logical events. Activation diagrams specify graphically which activities have to be performed upon some triggering event if an associated condition is satisfied. The developed editor supports both object/behavior diagrams and situation/activation diagrams. The editor performs syntactic consistency checks during the interactive design process. Moreover, by building the logical model in parallel with the diagrams, the editor guarantees that local semantic consistency checks can be performed incrementally, too. The editor clearly separates between schema data and pure visualization data describing the location of diagram elements. This separation facilitates the reuse of the generated data for further processing. Both schema data and visualization data are stored in the commercial object-oriented database system GemStone. Alternatively, those data may be stored in a file. The editor has been implemented using VisualWorks and MetaDoME, a framework for building graphical editors with VisualWorks.","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":"121425187","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}

引用次数: 6

A distribution-based clustering algorithm for mining in large spatial databases 大型空间数据库中基于分布的聚类挖掘算法

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

Xiaowei Xu, M. Ester, H. Kriegel, J. Sander

引用次数: 383

Asynchronous version advancement in a distributed three version database 分布式三版本数据库中的异步版本升级

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

DatabaseH. V. JagadishAT, Inderpal Singh MumickAT, Michael RabinovichAT

{"title":"Asynchronous version advancement in a distributed three version database","authors":"DatabaseH. V. JagadishAT, Inderpal Singh MumickAT, Michael RabinovichAT","doi":"10.1109/ICDE.1998.655805","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655805","url":null,"abstract":"We present an efficient protocol for multi-version concurrency control in distributed databases. The protocol creates no more than three versions of any data item, while guaranteeing that: update transactions never interfere with read-only transactions; the version advancement mechanism is completely asynchronous with (both update and read-only) user transactions; and read-only transactions do not acquire locks and do not write control information into the data items being read. This is an improvement over existing multi-versioning schemes for distributed databases, which either require a potentially unlimited number of versions, or require coordination between version advancement and user transactions. Our protocol can be applied in a centralized system also, where the improvement over existing techniques is in reducing the number of versions from four to three. The proposed protocol is valuable in large applications that currently shut off access to the system while managing version advancement manually, but now have a need for automating this process and providing continuous access to the data.","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":"131982596","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}

引用次数: 8

Efficient retrieval of similar time sequences under time warping 时间规整下相似时间序列的高效检索

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

Byoung-Kee Yi, H. Jagadish, C. Faloutsos

引用次数: 784

Leveraging mediator cost models with heterogeneous data sources 利用具有异构数据源的中介成本模型

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

Hubert Naacke, G. Gardarin, A. Tomasic

引用次数: 73