发布求助
文献互助 智能选刊 最新文献

1987 IEEE Third International Conference on Data Engineering最新文献

筛选
英文 中文
Implementing relational database operations in a cube-connected multicomputer system 在多维数据集连接的多计算机系统中实现关系数据库操作
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272354
C. Baru, O. Frieder
{"title":"Implementing relational database operations in a cube-connected multicomputer system","authors":"C. Baru, O. Frieder","doi":"10.1109/ICDE.1987.7272354","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272354","url":null,"abstract":"Parallel architectures for database processing should incorporate parallel CPU as well as parallel I/O (disk access) capability. The need to support parallel I/O gives rise to two important issues - data combination and non-uniform data distribution. Strategies for performing database operations in a cube-connected multicomputer system with parallel I/O are presented in this paper. The cube interconnection subsumes many other structures such as the tree, ring, etc. This property is exploited to efficiently support database operations such as Select, Aggregate, Join, and Project. The strategies presented here are unique in that they account for the non-uniform distribution of data across parallel paths by incorporating data redistribution steps as part of the overall algorithm. The two main data redistribution operations used are tuple balancing and merging. A simple analysis of the join and project operations is carried out assuming non-uniform data distributions. A more detailed simulation and study of issues related to query processing will be carried out as part of the future work.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115486652","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}
引用次数: 54
Linear hashing with Priority Splitting: A method for improving the retrieval performance of linear hashing 带优先级分割的线性哈希:一种提高线性哈希检索性能的方法
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272348
William D. Ruchte, A. L. Tharp
{"title":"Linear hashing with Priority Splitting: A method for improving the retrieval performance of linear hashing","authors":"William D. Ruchte, A. L. Tharp","doi":"10.1109/ICDE.1987.7272348","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272348","url":null,"abstract":"Linear hashing is a technique for constructing dynamic files for direct access. It has an advantage over other dynamic methods in that it lacks a directory. However, a weakness of the method is that at high packing factors, it requires more probes on the average to access a record than do many of the static methods. This paper presents a straightforward modification of linear hashing which, according to experimental results, significantly reduces the average number of retrieval probes in almost aft cases when compared with standard linear hashing. The parameter of overflow page size is an important one for adjusting performance. By choosing an appropriate overflow page size, the user may obtain results which are also better or comparable to those of other variants of linear hashing. In addition, the paper analyzes the effects of varying the primary page size, the overflow page size, and the packing factor on retrieval performance.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123427321","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
Design and implementation of GORDION, an object base management system 对象库管理系统GORDION的设计与实现
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272377
A. Ege, C. Ellis
{"title":"Design and implementation of GORDION, an object base management system","authors":"A. Ege, C. Ellis","doi":"10.1109/ICDE.1987.7272377","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272377","url":null,"abstract":"An experimental object base management system called Gordion is presented. Gordion is a server which provides permanence and sharing of objects for workstations within an object-oriented environment. Among the unique aspects of Gordion are: its ability to communicate with multiple languages, introduction of new concurrency control primitives, ability to manipulate objects of arbitrary size, and object sharing across the languages through a base set of classes. The system is currently interfaced to two languages, BiggerTalk and Zetalisp Flavors. Beside its language interface, Gordion has an interface for the system administrator, and an interface for debugging. Major functional components of the system are: concurrency control, storage, history and inquiry, and maintenance. Concurrent access to objects is regulated by four types of locks, and transactions encapsulate units of work for the system. The storage system uses a hashing scheme and Unix™ files to store objects. A discussion of the future prospects for Gordion concludes the paper.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126455932","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}
引用次数: 38
A performance model of synchronization mechanisms in a file system 文件系统同步机制的性能模型
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272380
A. Hác
{"title":"A performance model of synchronization mechanisms in a file system","authors":"A. Hác","doi":"10.1109/ICDE.1987.7272380","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272380","url":null,"abstract":"This paper presents a practical method for evaluating file systems in which synchronization mechanisms are modeled using measurable parameters. A queueing network model of a file system is introduced. The model allows various type of locks, multiple classes of transactions, and files and sectors shared by different types of transactions to be represented. The model parameters are estimated from the values of measurable quantities. The service times of lock servers are calculated as functions of the loads on all service centers. The various lock granularities can be represented by this model. Performance measures applicable to the evaluation of computer systems are introduced and evaluated. An example involving a file system and measurement data collected in a small business installation is given to compare performance measures provided by the simulation and analytic models.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130750932","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}
引用次数: 0
Database systems as controllers, managers and linguists a study of the relationship of database and operating systems 数据库系统作为控制者、管理者和语言学家，研究数据库和操作系统之间的关系
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272351
D. K. Hsiao
{"title":"Database systems as controllers, managers and linguists a study of the relationship of database and operating systems","authors":"D. K. Hsiao","doi":"10.1109/ICDE.1987.7272351","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272351","url":null,"abstract":"The study of the relationship of the database system and the operating system can best be characterized in terms of their issues on resource management and language support. In this paper the similarities and differences of these two types of systems (i.e., database systems and operating systems) on resource management and language support are articulated. It is hoped that this articulation can point out the new and future database-system research and development areas.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116017884","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}
引用次数: 0
Using 2-way semijoins in distributed query processing 在分布式查询处理中使用双向半连接
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272434
Hyunchul Kang, N. Roussopoulos
{"title":"Using 2-way semijoins in distributed query processing","authors":"Hyunchul Kang, N. Roussopoulos","doi":"10.1109/ICDE.1987.7272434","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272434","url":null,"abstract":"In distributed query processing, the semijoin has been used as an effective operator in reducing relations referenced in the query to reduce the total amount of data transmission. In this paper, we propose a new relational algebra operator, 2-way semijoin, which is an extended version of the semijoin, for more cost-effective distributed query processing. The 2-way semijoin is compared to the semijoin in terms of the reduction power and the propagation of reduction effects. We show that the 2-way semijoin has more reduction power than the semijoin and that the propagation of reduction effects by the 2-way semijoin is further than by the semijoin.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116365719","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}
引用次数: 25
Performance of complex queries in Main Memory Database Systems 主存数据库系统中复杂查询的性能
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272358
D. Bitton, M. Hanrahan, C. Turbyfill
{"title":"Performance of complex queries in Main Memory Database Systems","authors":"D. Bitton, M. Hanrahan, C. Turbyfill","doi":"10.1109/ICDE.1987.7272358","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272358","url":null,"abstract":"Memory residence can buy both functionality and performance for a database management system. In this paper, we present a description and a benchmark of an experimental implementation of a Main Memory Database System (MMDBS) that was designed to support complex interactive queries. We describe and evaluate the main memory database structures and query processing algorithms implemented in this prototype. Our measurements and analysis, focused on aggregates and joins, include both memory requirements and response time, since there is a clear trade-off between space and time in the design of a MMDBS. In contrast to conventional Disk-based Database Systems (DDBS's), we found that an MMDBS can efficiently execute complex relational queries. We identify strategies that exploit memory residence effectively. We also identified a number of performance problems related to query optimization in main memory and memory management for MMDBS's.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116431256","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}
引用次数: 26
A fault tolerant replicated storage system 一个容错复制存储系统
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272411
F. Bastani, I. Yen
{"title":"A fault tolerant replicated storage system","authors":"F. Bastani, I. Yen","doi":"10.1109/ICDE.1987.7272411","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272411","url":null,"abstract":"One way of achieving high availability of data in a distributed system is to replicate the data on several nodes. We present an algorithm for a replicated storage system which takes advantage of the high reliability of ETHERNET local area networks and their broadcast capability. The algorithm is both simple and efficient. It does not use reliable communication protocols and does not require a separate recovery procedure or knowledge of the current status (up or down) of the other nodes in the network. It guarantees that all transactions will be completed within a finite time and that no record will be locked indefinitely. We discuss the properties of the algorithm and some extensions to it. We also compare it with some other methods of managing replicated storage systems.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122911288","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
Functional disk system for relational database 关系型数据库功能磁盘系统
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272361
M. Kitsuregawa, M. Nakano, L. Harada, M. Takagi
{"title":"Functional disk system for relational database","authors":"M. Kitsuregawa, M. Nakano, L. Harada, M. Takagi","doi":"10.1109/ICDE.1987.7272361","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272361","url":null,"abstract":"The major performance bottle neck in the current computer system is in the low-performance secondary system. The performance of the CPU has increased dramatically so far, about several orders of magnitude improvement has been achieved. On the other hand, that of the disk system has shown little advance since nineteen sixties. The von Neumann bottle neck between the CPU and the secondary storage subsystem has been much more enlarged.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117054355","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
Data engineering for intelligent inference: Statistical data 智能推理的数据工程:统计数据
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272385
Sakti P. Ghosh
{"title":"Data engineering for intelligent inference: Statistical data","authors":"Sakti P. Ghosh","doi":"10.1109/ICDE.1987.7272385","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272385","url":null,"abstract":"Statistical processing of data has been around for a long time. In biblical times people were concerned with census data for tax collection purposes. The history of usage of statistics data prior to the eighteenth century is not well documented. In the eighteenth century mathematicians, like Pascal, when they invented probability theory, found the use of statistical data for estimating probabilities. The use of relative frequencies for estimating probabilities of events, can be considered as the first attempt of data engineering for intelligent inference. Of course, data engineering did not surface until the invention of computers, which was another two centuries later. In these two centuries Statistics developed as a science, specially in the later part of the nineteenth and the first half of the twentieth century. The age of computers followed the maturity of the science of statistics.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129275409","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信