The problem of updating materialized views in distributed database systems is discussed. An architecture and detailed procedures to update a collection of remote views with arbitrary refresh times by using a single differential file are prescribed. The efficiency of the update procedure is enhanced by adopting a multiple-query optimization approach and by introducing a powerful prescreening procedure to eliminate differential tuples. It is shown that even for a single remote view there are many instances where the presented update procedure performs better (with respect to total I/O and communication costs) than existing methods.<>
{"title":"Maintaining materialized views in distributed databases","authors":"A. Segev, Jooseok Park","doi":"10.1109/ICDE.1989.47225","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47225","url":null,"abstract":"The problem of updating materialized views in distributed database systems is discussed. An architecture and detailed procedures to update a collection of remote views with arbitrary refresh times by using a single differential file are prescribed. The efficiency of the update procedure is enhanced by adopting a multiple-query optimization approach and by introducing a powerful prescreening procedure to eliminate differential tuples. It is shown that even for a single remote view there are many instances where the presented update procedure performs better (with respect to total I/O and communication costs) than existing methods.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"64 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":"125089277","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 novel class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as dynamic random-sequential access method (DRSAM) and is derived from linear hashing. With respect to previous methods DRSAM presents the following characteristics: (1) the structure captures the hashed order in consecutive storage areas so that order-preserving schemes result in performance improvements for range queries and sequential processing; and (2) it adapts elastic buckets for the control of file growth. This approach outperforms the partial expansion method. The file structure is also extended with proper control mechanisms to cope with nonuniform distributions. The outcome is a multilevel trie stored as a two-level sequentially allocated file.<>
{"title":"Key-sequential access methods for very large files derived from linear hashing","authors":"N. Hachem, P. Berra","doi":"10.1109/ICDE.1989.47230","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47230","url":null,"abstract":"A novel class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as dynamic random-sequential access method (DRSAM) and is derived from linear hashing. With respect to previous methods DRSAM presents the following characteristics: (1) the structure captures the hashed order in consecutive storage areas so that order-preserving schemes result in performance improvements for range queries and sequential processing; and (2) it adapts elastic buckets for the control of file growth. This approach outperforms the partial expansion method. The file structure is also extended with proper control mechanisms to cope with nonuniform distributions. The outcome is a multilevel trie stored as a two-level sequentially allocated file.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"59 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":"115179949","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 behavior and performance of replica control protocols (RCP) that deal with network partitions is investigated using a quorum-based replicated database system called Seth. Seth is designed to be used as a transaction processing system, as well as a flexible experimentation tool. Seth's experimentation domain includes failures (site/link failure/repair rates), transactions (arrival rate, size, type, read/write ratio), quorum assignment, communications (communication protocols, network type, topology, number of sites), and transaction protocols (quorum-based RCPs, distributed commitment, concurrency control). The design and implementation of Seth are discussed, and two experiments are presented. The first studies the behavior of the quorum consensus protocol against different transition loads. The second experiment shows how expensive quorum-based replication is in terms of network traffic.<>
{"title":"SETH: a quorum-based database system for experimentation with failures","authors":"A. Helal, Jagannathan Srinivasan, B. Bhargava","doi":"10.1109/ICDE.1989.47278","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47278","url":null,"abstract":"The behavior and performance of replica control protocols (RCP) that deal with network partitions is investigated using a quorum-based replicated database system called Seth. Seth is designed to be used as a transaction processing system, as well as a flexible experimentation tool. Seth's experimentation domain includes failures (site/link failure/repair rates), transactions (arrival rate, size, type, read/write ratio), quorum assignment, communications (communication protocols, network type, topology, number of sites), and transaction protocols (quorum-based RCPs, distributed commitment, concurrency control). The design and implementation of Seth are discussed, and two experiments are presented. The first studies the behavior of the quorum consensus protocol against different transition loads. The second experiment shows how expensive quorum-based replication is in terms of network traffic.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"214 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":"116013796","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 knowledge-based database assistant, KDA, is described that has a query-guide function, an SQL-like database query generator, and an interface for subset-English. KDA can be used to design the front end of an SQL database system or a computer-based SQL tutorial system. A method is discussed for transforming a semantic network representing a user's conceptual query into one providing the information required by the system to respond to a query. The query pattern is an expression in natural language representing the semantic structure of concepts. The user expresses queries by filling parentheses in the query patterns with appropriate words. The query-pattern instances thus obtained are then translated into SQL-like relational database queries. The translation is carried out by evaluating operations defined on a semantic network named G-Net which conveys knowledge about application fields, the database schema, and the syntax of SQL.<>
{"title":"KDA: a knowledge-based database assistant","authors":"Xu Wu, Minoru Tanaka, T. Ichikawa","doi":"10.1109/ICDE.1989.47241","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47241","url":null,"abstract":"A knowledge-based database assistant, KDA, is described that has a query-guide function, an SQL-like database query generator, and an interface for subset-English. KDA can be used to design the front end of an SQL database system or a computer-based SQL tutorial system. A method is discussed for transforming a semantic network representing a user's conceptual query into one providing the information required by the system to respond to a query. The query pattern is an expression in natural language representing the semantic structure of concepts. The user expresses queries by filling parentheses in the query patterns with appropriate words. The query-pattern instances thus obtained are then translated into SQL-like relational database queries. The translation is carried out by evaluating operations defined on a semantic network named G-Net which conveys knowledge about application fields, the database schema, and the syntax of SQL.<<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":"129593596","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 extending a conventional DBMS (database management system) for geographic applications. The interface language SQL is augmented to allow formulation of queries involving both spatial and nonspatial selection criteria. A novel indexing structure is supported to facilitate query retrieval that is based on spatial proximity. To enable hybrid queries to be evaluated efficiently, an extended optimization strategy is proposed that evaluates minimal implementation effort.<>
{"title":"Extending a DBMS for geographic applications","authors":"B. Ooi, R. Sacks-Davis, Ken J. McDonell","doi":"10.1109/ICDE.1989.47266","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47266","url":null,"abstract":"A method is presented for extending a conventional DBMS (database management system) for geographic applications. The interface language SQL is augmented to allow formulation of queries involving both spatial and nonspatial selection criteria. A novel indexing structure is supported to facilitate query retrieval that is based on spatial proximity. To enable hybrid queries to be evaluated efficiently, an extended optimization strategy is proposed that evaluates minimal implementation effort.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"126 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":"128437775","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 design of the cell tree, an object-oriented dynamic index structure for geometric databases, is described. The data objects in the database are represented as unions of convex point sets (cells). The cell tree is a balanced tree structure whose leaves contain the cells and whose interior nodes correspond to a hierarchy of nested convex polyhedra. This index structure allows quick access to the cells (and thereby to the data objects) that occupy a given location in space. The cell tree is designed for paged secondary memory to minimize the number of disk accesses occurring during a tree search. Point locations and range searches can be carried out very efficiently using the cell tree.<>
{"title":"The design of the cell tree: an object-oriented index structure for geometric databases","authors":"O. Günther","doi":"10.1109/ICDE.1989.47267","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47267","url":null,"abstract":"The design of the cell tree, an object-oriented dynamic index structure for geometric databases, is described. The data objects in the database are represented as unions of convex point sets (cells). The cell tree is a balanced tree structure whose leaves contain the cells and whose interior nodes correspond to a hierarchy of nested convex polyhedra. This index structure allows quick access to the cells (and thereby to the data objects) that occupy a given location in space. The cell tree is designed for paged secondary memory to minimize the number of disk accesses occurring during a tree search. Point locations and range searches can be carried out very efficiently using the cell tree.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"37 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":"116470985","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 description is given of the secure distributed data management (SDDM) system, which is a prototype of a distributed architecture for multilevel database security that meets the US Department of Defense's trusted computer system evaluation criteria at the B3 level. The distributed architecture separates data by its security classification onto multiple single-level back-end database hosts and uses distributed data-management technology to provide integrated access to the distributed multilevel database. Discretionary access control is provided by access views defined on the database. An overview of the SDDM system, particularly its security policy, design, and provisions for mandatory and discretionary access controls is provided.<>
{"title":"SDDM-a prototype of a distributed architecture for database security","authors":"C. D. Jensen, Robert M. Kiel, R. D. Verjinski","doi":"10.1109/ICDE.1989.47236","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47236","url":null,"abstract":"A description is given of the secure distributed data management (SDDM) system, which is a prototype of a distributed architecture for multilevel database security that meets the US Department of Defense's trusted computer system evaluation criteria at the B3 level. The distributed architecture separates data by its security classification onto multiple single-level back-end database hosts and uses distributed data-management technology to provide integrated access to the distributed multilevel database. Discretionary access control is provided by access views defined on the database. An overview of the SDDM system, particularly its security policy, design, and provisions for mandatory and discretionary access controls is provided.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":" 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113952842","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 solution is proposed to the problem of providing support for operations over partially matched domains. Mismatched domains occur when information must be obtained from databases that were developed independently. Domain differences are resolved by mapping conflicting attributes to a common domain and the applying a set of extended relational operations to the resulting values. The values that result from attribute mappings can be total or partial. Some of the theoretical issues involved in this approach are discussed, and a set of extended relational operators that formalize operations across partial values is defined.<>
{"title":"Performing operations over mismatched domains","authors":"L. DeMichiel","doi":"10.1109/ICDE.1989.47198","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47198","url":null,"abstract":"A solution is proposed to the problem of providing support for operations over partially matched domains. Mismatched domains occur when information must be obtained from databases that were developed independently. Domain differences are resolved by mapping conflicting attributes to a common domain and the applying a set of extended relational operations to the resulting values. The values that result from attribute mappings can be total or partial. Some of the theoretical issues involved in this approach are discussed, and a set of extended relational operators that formalize operations across partial values is defined.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"77 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":"114844212","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 issue of joining information about the same instance across disparate databases in a composite information system (CIS) environment is discussed. A technique called interdatabase instance identification is presented that is a combination of database management systems and artificial intelligence techniques. Common attributes in the disparate databases are applied first to reduce the number of potential candidates for the same instance. Other attributes in these databases, auxiliary databases, and inferencing rules are utilized next to identify the same instance. A detailed example of the interdatabase instance identification technique is presented using an operational research prototype.<>
{"title":"The inter-database instance identification problem in integrating autonomous systems","authors":"Richard Y. Wang, S. Madnick","doi":"10.1109/ICDE.1989.47199","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47199","url":null,"abstract":"The issue of joining information about the same instance across disparate databases in a composite information system (CIS) environment is discussed. A technique called interdatabase instance identification is presented that is a combination of database management systems and artificial intelligence techniques. Common attributes in the disparate databases are applied first to reduce the number of potential candidates for the same instance. Other attributes in these databases, auxiliary databases, and inferencing rules are utilized next to identify the same instance. A detailed example of the interdatabase instance identification technique is presented using an operational research prototype.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"215 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":"121686097","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}
N. Steger, H. Schmidt, Ulrich Güntzer, Werner Kießling
A coherent approach is presented that extends relational and deductive database technology toward an integration of expert-system applications, which require sound and efficient capabilities to deal with uncertainty. Extending logic programming, the authors define the semantics of quantitative deductive databases, where fixpoint theory plays a central role. Calculus gives the rule programmer a great deal of flexibility to tailor the aggregation of certainties according to the application expertise at hand. Extending relational algebra, the authors also introduce a quantitative relational algebra as a suitable target language for rule compilation. This approach makes rule-based expert systems requiring uncertainty reasoning on large and complex data, feasible for a variety of practical application areas.<>
{"title":"Semantics and efficient compilation for quantitative deductive databases","authors":"N. Steger, H. Schmidt, Ulrich Güntzer, Werner Kießling","doi":"10.1109/ICDE.1989.47274","DOIUrl":"https://doi.org/10.1109/ICDE.1989.47274","url":null,"abstract":"A coherent approach is presented that extends relational and deductive database technology toward an integration of expert-system applications, which require sound and efficient capabilities to deal with uncertainty. Extending logic programming, the authors define the semantics of quantitative deductive databases, where fixpoint theory plays a central role. Calculus gives the rule programmer a great deal of flexibility to tailor the aggregation of certainties according to the application expertise at hand. Extending relational algebra, the authors also introduce a quantitative relational algebra as a suitable target language for rule compilation. This approach makes rule-based expert systems requiring uncertainty reasoning on large and complex data, feasible for a variety of practical application areas.<<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":"115547861","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
扫码关注我们
求助内容：
应助结果提醒方式：