The second version of FDS-R (functional disk system with relational database engine), FDS-RII, which is designed to handle large relations efficiently, is discussed. On FDS-RII, the processing algorithm is selected at run time from two algorithms (nested loop algorithms, grace hash algorithm) by comparing their estimated I/O costs. The processing strategy is discussed in detail. The I/O cost formula is examined by measuring the execution time of a join query on the FDS-RII. With the expanded version of Wisconsin Benchmark, the performance of FDS-RII is measured. FDS-RII attained a high performance level for large relations as compared to other large database systems such as Gamma and Teradata. While FDS uses just one disk and three MC68020s, Teradata uses 40 disks and 20 AMPs and Gamma requires eight disks and 17 VAX 11/750s.<>
讨论了基于关系数据库引擎的功能磁盘系统(functional disk system with relational database engine, FDS-RII)的第二版——FDS-RII。在FDS-RII上，通过比较估计的I/O成本，在运行时从两种算法(嵌套循环算法、grace哈希算法)中选择处理算法。详细讨论了加工策略。通过测量FDS-RII上连接查询的执行时间来检查I/O成本公式。通过威斯康星基准的扩展版本，对FDS-RII的性能进行了测量。与Gamma和Teradata等其他大型数据库系统相比，FDS-RII在处理大型关系方面达到了很高的性能水平。FDS只需要一个磁盘和三个mc68020, Teradata需要40个磁盘和20个amp, Gamma需要8个磁盘和17个VAX 11/750。
{"title":"Query execution for large relations on functional disk system","authors":"M. Kitsuregawa, M. Nakano, M. Takagi","doi":"10.1109/ICDE.1989.47211","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47211","url":null,"abstract":"The second version of FDS-R (functional disk system with relational database engine), FDS-RII, which is designed to handle large relations efficiently, is discussed. On FDS-RII, the processing algorithm is selected at run time from two algorithms (nested loop algorithms, grace hash algorithm) by comparing their estimated I/O costs. The processing strategy is discussed in detail. The I/O cost formula is examined by measuring the execution time of a join query on the FDS-RII. With the expanded version of Wisconsin Benchmark, the performance of FDS-RII is measured. FDS-RII attained a high performance level for large relations as compared to other large database systems such as Gamma and Teradata. While FDS uses just one disk and three MC68020s, Teradata uses 40 disks and 20 AMPs and Gamma requires eight disks and 17 VAX 11/750s.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130480732","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}
An object exchange service (OXS) and an external object representation (EXTOR) are described in the context of a distributed object-oriented database. EXTOR is the common representation that facilitates the sharing of information among a network of machines. The aim is to represent complex structured information in an efficient external form and to provide maximal sharing of information among computing sessions. OXS is a service which, together with the concepts of object boundary, global objects, and object closure, provides the exchange of information using EXTOR. A brief description is provided of the distributed object-oriented system that utilizes this service, the performance results for OXS, and the future directions for the design of generalized object exchange services in heterogeneous computing environments.<>
{"title":"Object exchange service for an object-oriented database system","authors":"G. Pathak, J. Joseph, Steve Ford","doi":"10.1109/ICDE.1989.47197","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47197","url":null,"abstract":"An object exchange service (OXS) and an external object representation (EXTOR) are described in the context of a distributed object-oriented database. EXTOR is the common representation that facilitates the sharing of information among a network of machines. The aim is to represent complex structured information in an efficient external form and to provide maximal sharing of information among computing sessions. OXS is a service which, together with the concepts of object boundary, global objects, and object closure, provides the exchange of information using EXTOR. A brief description is provided of the distributed object-oriented system that utilizes this service, the performance results for OXS, and the future directions for the design of generalized object exchange services in heterogeneous computing environments.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133486450","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}
The philosophy of explicitly representing simple range classes for properties and explicitly specifying range and/or cardinality restrictions on inherited properties is adopted so that the membership of an object in classes is characterized by the object's property values. The motivation for this approach is twofold: first, it is in keeping with the database philosophy of emphasizing the representation of an application (rather than some intrinsic meaning); and second, it provides a framework for algorithmically verifying the structural aspects of the schema. An automatic classifier for the structural validation of object-oriented schemas based on sound and complete rules of inference is presented. If the classifier discovers structural relationships and/or inconsistencies, the designer can refine the schema to reflect the semantics of the application. Thus the classifier serves as an interactive design tool that can be used at any stage during the design process.<>
{"title":"Automatic validation of object-oriented database structures","authors":"L. Delcambre, K. Davis","doi":"10.1109/ICDE.1989.47194","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47194","url":null,"abstract":"The philosophy of explicitly representing simple range classes for properties and explicitly specifying range and/or cardinality restrictions on inherited properties is adopted so that the membership of an object in classes is characterized by the object's property values. The motivation for this approach is twofold: first, it is in keeping with the database philosophy of emphasizing the representation of an application (rather than some intrinsic meaning); and second, it provides a framework for algorithmically verifying the structural aspects of the schema. An automatic classifier for the structural validation of object-oriented schemas based on sound and complete rules of inference is presented. If the classifier discovers structural relationships and/or inconsistencies, the designer can refine the schema to reflect the semantics of the application. Thus the classifier serves as an interactive design tool that can be used at any stage during the design process.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133623618","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}
A data model and an access method for summary data management are proposed. Summary data, represented as a trinary tuple , consist of metaknowledge summarized by a statistical function of a category of individual information typically stored in a conventional database. The concept of category (type or class) and the additivity property of statistical functions form a basis for the model that allows for the derivation of summary data. The complexity of deriving summary data has been found computationally intractable in general, and the proposed summary data model, with disjointness constraint, solves the problem without the loss of information. The proposed access method, called the summary data tree, or SD-tree, which handles an orthogonal category as a hyperrectangle, realizes the proposed summary data model. The structure of the SD-tree provides for efficient operations including summary data search, derivation, and insertion on the stored summary data.<>
{"title":"A data model and access method for summary data management","authors":"Meng Chang Chen, L. McNamee","doi":"10.1109/ICDE.1989.47220","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47220","url":null,"abstract":"A data model and an access method for summary data management are proposed. Summary data, represented as a trinary tuple , consist of metaknowledge summarized by a statistical function of a category of individual information typically stored in a conventional database. The concept of category (type or class) and the additivity property of statistical functions form a basis for the model that allows for the derivation of summary data. The complexity of deriving summary data has been found computationally intractable in general, and the proposed summary data model, with disjointness constraint, solves the problem without the loss of information. The proposed access method, called the summary data tree, or SD-tree, which handles an orthogonal category as a hyperrectangle, realizes the proposed summary data model. The structure of the SD-tree provides for efficient operations including summary data search, derivation, and insertion on the stored summary data.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132248659","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}
A method is presented for indexing terms in a knowledge-base retrieval-by-unification (RBU) system. The term is a well-defined structure which represents knowledge using variables. RBU operations are an extension of relational database operations using unification and backtracking to retrieve terms from term relations. The term indexing proposed uses hashing and trie structures to reduce the number of comparisons between elements of a search condition and of an object term relation. Unification on a trie structure is suited to backtracking bindings of variables. The search and updating speed of an RBU prototype is measured to evaluate the indexing method. This method is effective for fast term retrieval for a large number of similar and varied form terms. The overhead for maintaining indexes in updating is low.<>
{"title":"Term indexing for retrieval by unification","authors":"H. Yokota, H. Kitakami, A. Hattori","doi":"10.1109/ICDE.1989.47231","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47231","url":null,"abstract":"A method is presented for indexing terms in a knowledge-base retrieval-by-unification (RBU) system. The term is a well-defined structure which represents knowledge using variables. RBU operations are an extension of relational database operations using unification and backtracking to retrieve terms from term relations. The term indexing proposed uses hashing and trie structures to reduce the number of comparisons between elements of a search condition and of an object term relation. Unification on a trie structure is suited to backtracking bindings of variables. The search and updating speed of an RBU prototype is measured to evaluate the indexing method. This method is effective for fast term retrieval for a large number of similar and varied form terms. The overhead for maintaining indexes in updating is low.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124587372","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}
The use of classification and subsumption to process database queries is discussed. The data model, called CANDIDE, is essentially an extended version of the FL-1, KANDOR and BACK, frame-based knowledge representation languages. A novel feature of the approach is that the data-description language and data-manipulation language are identical, thus providing uniform treatment of data objects, query objects and view objects. The classification algorithm find the correct placement for a query object in a given object taxonomy. Tractability issues are explored, and the expressiveness of queries is compared with relational algebra. This data model has been implemented in POPLOG as the basis for a knowledge-base management system that includes an integrated natural-language query system.<>
{"title":"Classification as a query processing technique in the CANDIDE semantic data model","authors":"H. Beck, Sunit K. Gala, S. Navathe","doi":"10.1109/ICDE.1989.47264","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47264","url":null,"abstract":"The use of classification and subsumption to process database queries is discussed. The data model, called CANDIDE, is essentially an extended version of the FL-1, KANDOR and BACK, frame-based knowledge representation languages. A novel feature of the approach is that the data-description language and data-manipulation language are identical, thus providing uniform treatment of data objects, query objects and view objects. The classification algorithm find the correct placement for a query object in a given object taxonomy. Tractability issues are explored, and the expressiveness of queries is compared with relational algebra. This data model has been implemented in POPLOG as the basis for a knowledge-base management system that includes an integrated natural-language query system.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130604318","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}
A quantitative performance study of two-phase locking in a parallel database machine using a simulation-based methodology is presented. The DBSIM simulation methodology uses a Petri-net model at the higher level and a queuing network model at the lower level. The Petri net model captures the characteristics of parallelism and synchronization at the workload level, while the queuing network model captures queuing aspects of the system at the physical resource level. Transactions in a workload are specified using a performance-oriented specification language based on the transaction component graph: a data-flow graph with database operators. The transaction specifications are translated into Petri-net representations to drive the simulation experiments. Results of an analysis of a two-phase locking strategy with machine sizes ranging from 4 to 256 processors are presented.<>
{"title":"Locking performance in a shared nothing parallel database machine","authors":"B. P. Jenq, B. C. Twichell, T. Keller","doi":"10.1109/ICDE.1989.47210","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47210","url":null,"abstract":"A quantitative performance study of two-phase locking in a parallel database machine using a simulation-based methodology is presented. The DBSIM simulation methodology uses a Petri-net model at the higher level and a queuing network model at the lower level. The Petri net model captures the characteristics of parallelism and synchronization at the workload level, while the queuing network model captures queuing aspects of the system at the physical resource level. Transactions in a workload are specified using a performance-oriented specification language based on the transaction component graph: a data-flow graph with database operators. The transaction specifications are translated into Petri-net representations to drive the simulation experiments. Results of an analysis of a two-phase locking strategy with machine sizes ranging from 4 to 256 processors are presented.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121076832","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}
A system is presented for the compact representation of multiple versions of a file. The presentation is in terms of vectors and matrices, which results in conceptual simplicity. Algebraic transformations enable the retrieval process to be optimized for any given version or set of versions, in contrast to always optimizing for the most recent or least recent version. Moreover, any version can be added or deleted without affecting any other. File differencing and dictionary compaction are unified, and data compression can be included. A compact representation for the (sparse) matrices is presented, and the main algorithms are described in terms of this representation.<>
{"title":"A compact representation for file versions: a preliminary report","authors":"A. Black, C. H. Burris","doi":"10.1109/ICDE.1989.47232","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47232","url":null,"abstract":"A system is presented for the compact representation of multiple versions of a file. The presentation is in terms of vectors and matrices, which results in conceptual simplicity. Algebraic transformations enable the retrieval process to be optimized for any given version or set of versions, in contrast to always optimizing for the most recent or least recent version. Moreover, any version can be added or deleted without affecting any other. File differencing and dictionary compaction are unified, and data compression can be included. A compact representation for the (sparse) matrices is presented, and the main algorithms are described in terms of this representation.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125438061","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}
An analytic model is presented for the performance of a commit protocol which considers both the communication and local processing. It is shown that the local queuing delays are significant when the number of atomic actions is sufficiently large. The single most important parameter in determining the effect of commit protocols on the system performance is believed to be the heavy dependence on logging and hence the high performance penalities exacted by I/O operations.<>
{"title":"Performance analysis of distributed commit protocols","authors":"T. Chen, K. Ramarao","doi":"10.1109/ICDE.1989.47256","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47256","url":null,"abstract":"An analytic model is presented for the performance of a commit protocol which considers both the communication and local processing. It is shown that the local queuing delays are significant when the number of atomic actions is sufficiently large. The single most important parameter in determining the effect of commit protocols on the system performance is believed to be the heavy dependence on logging and hence the high performance penalities exacted by I/O operations.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127922672","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}
Experimentation with several methods of providing efficient communication facilities for distributed database systems is described. These studies give insight into the delays incurred by applications running on distributed systems. Five different mechanisms for local interprocess communications (two variations with message queues, named pipes, shared memory, and UDP sockets) have been implemented, compared, and analyzed. The most efficient of these is three times as fast as UDP for 1000-byte messages. Kernel-level software multicast and hardware multicast have also been implemented and their performance analyzed. The results show the significant advantage of using these techniques instead of using multiple sends and receives at the user level. The design of a facility that allows the dynamic addition of user-level protocols such as two-phase commit, clock synchronization, etc. to an operating system kernel is presented. The facility is based on a simple stack-based language that provides the functionality and security required.<>
{"title":"Implementation and measurements of efficient communication facilities for distributed database systems","authors":"B. Bhargava, E. Mafla, J. Riedl, B. Sauder","doi":"10.1109/ICDE.1989.47215","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47215","url":null,"abstract":"Experimentation with several methods of providing efficient communication facilities for distributed database systems is described. These studies give insight into the delays incurred by applications running on distributed systems. Five different mechanisms for local interprocess communications (two variations with message queues, named pipes, shared memory, and UDP sockets) have been implemented, compared, and analyzed. The most efficient of these is three times as fast as UDP for 1000-byte messages. Kernel-level software multicast and hardware multicast have also been implemented and their performance analyzed. The results show the significant advantage of using these techniques instead of using multiple sends and receives at the user level. The design of a facility that allows the dynamic addition of user-level protocols such as two-phase commit, clock synchronization, etc. to an operating system kernel is presented. The facility is based on a simple stack-based language that provides the functionality and security required.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129451831","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：