Proceedings of 1994 IEEE 10th International Conference on Data Engineering最新文献_第5页

Analysis of common subexpression exploitation models in multiple-query processing 多查询处理中常用子表达式开发模型分析

Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283068

Jamal R. Alsabbagh, Vijay V. Raghavan

引用次数: 24

Exploiting uniqueness in query optimization 在查询优化中利用唯一性

Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283003

Satyanarayana R. Valluri, Arvind Hulgeri, K. Karlapalem

引用次数: 49

Declustering techniques for parallelizing temporal access structures 并行时态访问结构的聚类技术

Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283036

V. Kouramajian, R. Elmasri, Anurag Chaudhry

{"title":"Declustering techniques for parallelizing temporal access structures","authors":"V. Kouramajian, R. Elmasri, Anurag Chaudhry","doi":"10.1109/ICDE.1994.283036","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283036","url":null,"abstract":"This paper addresses the issues of declustering temporal index and access structures for a single processor multiple independent disk architecture. The temporal index is the Monotonic B/sup +/-Tree which uses the time index temporal access structure. We devise a new algorithm, called multi-level round robin, for assigning tree nodes to multiple disks. The multi-level round robin declustering technique takes advantage of the append-only nature of temporal databases to achieve uniform load distribution, decrease response time, and increase the fanout of the tree by eliminating the need to store disk numbers within the tree nodes. We propose two declustering techniques for the time index access structures; one considers only time proximity while declustering, whereas the other considers both time proximity and data size. We investigate their performance over different types of temporal queries and show that various temporal queries have conflicting allocation criteria for the time index buckets. In addition, we devise two disk partition techniques for the time index buckets. The mutually exclusive technique partitions the disks into disjoint groups, whereas the shared disk technique allows the different types of buckets to share all disks.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129551352","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

On the interaction between ISA and cardinality constraints 关于ISA和基数约束之间的相互作用

Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283032

Diego Calvanese, M. Lenzerini

{"title":"On the interaction between ISA and cardinality constraints","authors":"Diego Calvanese, M. Lenzerini","doi":"10.1109/ICDE.1994.283032","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283032","url":null,"abstract":"ISA and cardinality constraints are among the most interesting types of constraints in data models. ISA constraints are used to establish several forms of containment among classes, and are receiving great attention in moving to object-oriented data models, where classes are organized in hierarchies based on a generalization/specialization principle. Cardinality constraints impose restrictions on the number of links of a certain type involving every instance of a given class, and can be used for representing several forms of dependencies between classes, including functional and existence dependencies. While the formal properties of each type of constraints are now well understood, little is known of their interaction. We present an effective method for reasoning about a set of ISA and cardinality constraints in the context of a simple data model based on the notions of classes and relationships. In particular, the method allows one both to verify the satisfiability of a schema and to check whether a schema implies a given constraint of any of the two kinds. We prove that the method is sound and complete, thus showing that the reasoning problem for ISA and cardinality constraints is decidable.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128301917","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}

引用次数: 78

X.500 Directory Schema management X.500目录模式管理

Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283056

D. Silver, J. W. Hong, M. Bauer

引用次数: 1

Mariposa: a new architecture for distributed data Mariposa:分布式数据的新架构

Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283004

M. Stonebraker, Paul M. Aoki, Robert Devine, W. Litwin, Michael A. Olson

引用次数: 112

Sort-merge-join: an idea whose time has(h) passed? 排序-合并-连接:一个过时的想法?

Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283062

G. Graefe

引用次数: 64

Performance analysis of RAIDS disk arrays with a vacationing server model for rebuild mode operation 基于休假服务器模型的raid磁盘阵列性能分析

Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.282999

Alexander Thomasian, J. Menon

引用次数: 53

Efficient organization of large multidimensional arrays 高效组织大型多维数组

Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283048

Sunita Sarawagi, M. Stonebraker

引用次数: 306

Resolving attribute incompatibility in database integration: an evidential reasoning approach 数据库集成中属性不兼容的解决:一种证据推理方法

Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283022

Ee-Peng Lim, J. Srivastava, S. Shekhar

引用次数: 65