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

Proceedings. Fourth International Conference on Data Engineering最新文献

筛选
英文 中文
Adaptive algorithms for balanced multidimensional clustering 平衡多维聚类的自适应算法
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105482
Clement T. Yu, T. Jiang
{"title":"Adaptive algorithms for balanced multidimensional clustering","authors":"Clement T. Yu, T. Jiang","doi":"10.1109/ICDE.1988.105482","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105482","url":null,"abstract":"The G-K-D tree (generalized K-D tree) method aims at reducing the average number of data page accesses per query, but it ignores the cost of index search. The authors propose two adaptive algorithms that take into consideration both data page access cost and index page access cost. It attempts to find a minimum total cost. Experimental results indicate that the proposed algorithms are superior to the G-K-D tree method.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114380844","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}
引用次数: 2
Concurrent storage structure conversion: from B+ tree to linear hash file 并发存储结构转换:从B+树到线性哈希文件
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105507
E. Omiecinski
{"title":"Concurrent storage structure conversion: from B+ tree to linear hash file","authors":"E. Omiecinski","doi":"10.1109/ICDE.1988.105507","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105507","url":null,"abstract":"Shows that the efficient reorganization of a B+ tree file into a linear hash file can be done concurrently with user transaction processing. This conversion is motivated by a change in database processing, in which efficient sequential and direct access were originally needed, but now only efficient direct access is needed. This is quite reasonable for a database system which accommodates new and changing applications. Several existing database systems, e.g. INGRES, IMS and IDMS allow this type of reorganization, but the reorganization is performed offline. The author devises an algorithm which performs the conversion and presents an analytic model of the conversion process. The author uses a typical database simulation model to evaluate the reorganization scheme. The results from the analytic model are within 3% (on the average) of the observed simulation results.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114485919","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}
引用次数: 10
Transaction atomicity in the presence of network partitions 存在网络分区时的事务原子性
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105498
K. Ramarao
{"title":"Transaction atomicity in the presence of network partitions","authors":"K. Ramarao","doi":"10.1109/ICDE.1988.105498","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105498","url":null,"abstract":"A study is made of the network partition failure and the necessary and sufficient conditions are determined for the implementation of atomic transactions in the presence of partitions. Two aspects are explored: properties of the distributed system and the topology of the communication network. The essence of the results reported is that protocols to implement atomic actions in spite of partitions exist only under unrealistically strong conditions.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114767089","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 functional clustering method for optimal access to complex domains in a relational DBMS 关系型DBMS中复杂域最优访问的功能聚类方法
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105483
J. Cheiney, J. Kiernan
{"title":"A functional clustering method for optimal access to complex domains in a relational DBMS","authors":"J. Cheiney, J. Kiernan","doi":"10.1109/ICDE.1988.105483","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105483","url":null,"abstract":"The authors present a clustering method for complex domains. The method is original in that tuples can be clustered using functions applied to complex domain values. Thus, tuples are organized according to a function result. Those functions most often applied to complex values and used in the restriction part of queries can be used as clustering predicates. Hence, they optimize the retrieval of tuples that would otherwise require processing the whole relation. In SABRINA, complex domain processing is made possible by a Lisp language processor designed as an integrated database management system processor. Clustering is determined by a set of predicates defining a recursive partitioning of the relation. These predicates are the Lisp functions, taken from the set of functions applicable to a given domain. The authors demonstrate that by using the same approach for a data manipulation language and a clustering strategy, few modifications of the DBMS program are required and the assertional power of the DBMS is upgraded while respecting performance considerations.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124092241","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
An exact probability model for finite hash tables 有限哈希表的精确概率模型
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105480
M. Ramakrishna
{"title":"An exact probability model for finite hash tables","authors":"M. Ramakrishna","doi":"10.1109/ICDE.1988.105480","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105480","url":null,"abstract":"The author presents an exact probability model for finite hash tables and applies the model to solve a few problems in the analysis of hashing techniques. The model enables exact computation of table sufficiency index, a parameter useful in the design of small hash tables. The author also presents an exact analysis of the expected length of the longest probe sequence in hashing with separate chaining, and successful search length in infinite uniform hashing giving explicit expressions. It appears that the model can be extended to analyze other hashing schemes such as bounded disorder index method, and to problems in robust data structures, etc.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115999297","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}
引用次数: 17
A model for adaptable systems for transaction processing 用于事务处理的适应性系统的模型
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105444
Bharat K. Bhargava, J. Riedl
{"title":"A model for adaptable systems for transaction processing","authors":"Bharat K. Bhargava, J. Riedl","doi":"10.1109/ICDE.1988.105444","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105444","url":null,"abstract":"A model is presented for an adaptable system that allows online switching of classes of algorithms for database transaction processing. The basic idea is to identify conditions on the state of processing that will maintain consistency during the switch from one class to another. The classes of concurrency control algorithms and the formalism of history for transaction processing and serializability have been used to develop this research. In addition to the formalism, the precise conditions for switching digraph-serializable (DSR) algorithms have been given. This research is being applied to switching network partition protocols (conservative to optimistic), commit protocols, recovery block software, and has led towards the design of an adaptable and reconfigurable distributed database system. An experimental system called RAID has been implemented to test these ideas; it has been noted that adaptability provides for varying performance requirements and deals with failures of sites, transactions, and other components of the system.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131917921","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}
引用次数: 37
File allocation on homogeneous local computer systems with two-level multiaccess networks 具有两级多址网络的同构本地计算机系统的文件分配
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105450
Y. Lien, Yih-Long Chang, B. Wah
{"title":"File allocation on homogeneous local computer systems with two-level multiaccess networks","authors":"Y. Lien, Yih-Long Chang, B. Wah","doi":"10.1109/ICDE.1988.105450","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105450","url":null,"abstract":"Various versions of the file allocation problem on homogeneous two-level local multiaccess networks are examined. The problems associated with file allocation are more simple on two-level networks than on general point-to-point networks because the communication cost for accessing a file is reduced to a three-value variable. File allocation with storage-limit constraints is still NP-hard. The optimal solution, given these conditions, involves transformation into a pure zero-one integer programming problem and a search algorithm based on E. Balas's additive algorithm (1965). In the case in which the system is dominated by the communication cost, the simple file allocation problem is polynomially solvable. An efficient heuristic algorithm with guaranteed performance is proposed for this special case.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121093865","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}
引用次数: 5
Using common subexpressions to optimize multiple queries 使用公共子表达式来优化多个查询
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105474
Jooseok Park, A. Segev
{"title":"Using common subexpressions to optimize multiple queries","authors":"Jooseok Park, A. Segev","doi":"10.1109/ICDE.1988.105474","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105474","url":null,"abstract":"The problem of identifying common subexpressions and using them in the simultaneous optimization of multiple queries is dealt with. In particular, emphasis is placed on the strategy of selecting access plans for single queries and their integration into a global access plan that takes advantage of common tasks. A dynamic programming algorithm is presented for the selection of individual access plans such that the resulting global access plan is of minimum processing cost. The computational complexity of this algorithm represents a significant improvement over existing algorithms.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116940674","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}
引用次数: 109
首页 上一页
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学术官方微信