{"title":"A decomposition algorithm for distributed hash join query processing","authors":"S. Spetka","doi":"10.1109/RIDE.1992.227424","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227424","url":null,"abstract":"Database systems are increasing in importance as stage repositories for applications like CAD and AI. These applications demand efficient support for queries that are more complex than the common business queries that are supported well by most systems. More queries are also of an ad-hoc nature, limiting the utility of precompilation approaches. The need for fast response to make AI and CAD applications feasible also has further motivated research into techniques for exploiting resources in a distributed system for improved performance. This paper explores query decomposition techniques for complex query processing in distributed database systems and exposes the deficiencies associated with current algorithms.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114276295","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}
{"title":"Strong recoverability in multidatabase systems","authors":"Y. Breitbart, A. Silberschatz","doi":"10.1109/RIDE.1992.227409","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227409","url":null,"abstract":"A multidatabase system (MDBS) consists of a number of multiple autonomous database management systems (DBMSs) in which global transactions are executed under the control of the MDBS, and local transactions are executed under the control of a local DBMS. Each local DBMS ensures local serializability. The function of the MDBS is to ensure global serializability. The major difficulty in ensuring global serializability stems from the fact that in the presence of local transactions, and without any restrictions on the local concurrency control of the participating local DBMSs., even serial execution of global transactions does not guarantee global serializability. These difficulties could be avoided if the serialization order of transactions were always the same as their commitment order. The authors study the class of transaction scheduling mechanisms in which transaction serialization order can be determined by controlling their commitment order. They use these results to design a multidatabase transaction management scheme that ensures global serializability.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124855441","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}
{"title":"An event-state approach to handling temporal queries in an extended relational database system","authors":"Bin Li, T. C. Ting","doi":"10.1109/RIDE.1992.227400","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227400","url":null,"abstract":"Many database applications such as office information systems, computer aided design and manufacturing require temporal support. The requirement for storing all the historical information has resulted in performance and storage problems. This paper presents and illustrates an event-state approach to effectively and efficiently store and retrieve temporal data. This model demonstrates that by using the events that have occurred, facilities can be constructed that would permit the processes of 'rolling-back' to a historical state and/or 'rolling-forward' to the then current state. The proposed temporal features have been incorporated in a relational database system. Processing efficiency and temporal query capabilities have been illustrated and discussed.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130887078","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}
{"title":"In-memory databases: an industry perspective","authors":"Antonio Pizzarello, F. Golshani","doi":"10.1109/RIDE.1992.227419","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227419","url":null,"abstract":"Main memory databases store all or part of the data in memory and subsequently reduce or eliminate disk access. This paper presents an architectural study of memory databases with respect to cost/performance trade-offs and applicability issues. Potential performance advantages depend primarily on whether the system is used as an online transaction processing or a decision support system. A major constraint to the storing of data in main memory is the vulnerability of its content to software errors. This fact may force a two level architecture even if main memories cost is considerably reduced.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121575565","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}
{"title":"Communication overhead of nested loop operation in multidatabase system","authors":"A. Rafii","doi":"10.1109/RIDE.1992.227394","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227394","url":null,"abstract":"This paper summarizes some of the results from a previous paper by the author (see DTD Technical Memo HPL-DTD-91-5, HP Labs., 1991). The purpose is to characterize the interprocess communication (IPC) overhead in the context of multidatabase operations. A quantitative analysis of the cost of a distributed query is becoming increasingly important as operations across multiple databases are becoming more common. A global nested-loop (NL) join method is one of the least-complicated methods for joining data across data sources. One of the advantages of the algorithm is that it works even when an external operation is a method call whose input parameters, unlike a query, must be bound at invocation time.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126573127","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}
{"title":"An index structure for parallel database processing","authors":"Takashi Honishi, T. Satoh, Ushio Inoue","doi":"10.1109/RIDE.1992.227395","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227395","url":null,"abstract":"In relational database management systems, indexing is a popular and powerful technique to accelerate database processing. There are two main research issues on indexing; index structures and access controls. The studies of index structures, which are usually trees or hashing, aim at lower access cost and smaller storage overhead. On the other hand, the studies of access controls focus on concurrency of transactions accessing the same index. The root node of a tree-structured index, is a hot hot spot accessed by several transactions concurrently. If index keys are inserted or deleted frequently, many conflicts occur and the performance of the system is degraded. This problem is serious in multiprocessor environments where several processors access the same database in parallel. Similar problems occur in intra-transaction parallelism. The response time of a transaction cannot be reduced enough if parallel portions of the transaction conflict with each other while updating an index. A new index structure and its access control are discussed to achieve inter- and intra-transaction parallelism on shared memory multiprocessors. They dominate the utilization of processors in the systems.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"42 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134407303","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}
{"title":"Generalized data stream indexing and temporal query processing","authors":"T. Y. Leung, R. Muntz","doi":"10.1109/RIDE.1992.227415","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227415","url":null,"abstract":"Presents a novel indexing technique for temporal data stream which are sorted on the effective start time attribute. The index can be exploited in processing complex temporal pattern queries (such as multi-way joins) that are qualified with snapshot operators (e.g. the 'as of' operator). The advantages and limitations of the proposed scheme and a quantitative analysis of the storage requirements are presented. The authors propose some optimization alternatives that can reduce the storage requirements.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131789642","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}
{"title":"On global query optimization in multidatabase systems","authors":"Hongjun Lu, M. Shan","doi":"10.1109/RIDE.1992.227401","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227401","url":null,"abstract":"Multidatabase management systems (MDBMS) enable data sharing among heterogeneous local databases (component databases) and thus provide interoperability required by diverse applications. In multidatabase systems, user requests data from the multidatabase by posing non-procedural queries. For a query involving more than one database, a global optimization should be performed to achieve good overall system performance. Among the research topics in multidatabase systems, little is reported on global query optimization. One of the reasons is that the significant differences among the optimization problem for multidatabase and the distributed homogeneous system are not well recognized.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116167603","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}
{"title":"An approach to support method invocations in object-oriented queries","authors":"E. Bertino, A. Quarati","doi":"10.1109/RIDE.1992.227410","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227410","url":null,"abstract":"An indexing technique is presented supporting an efficient evaluation of query predicates on methods. The technique is based on the precomputation of method results. The precomputed results are stored in an index that associates with a result v the list of object identifiers for which the method execution returns v. The evaluation of a predicate on the results of a method simply requires an index search. The proposed organization keeps track of changes that may influence the results of a method invocation. This mechanism is used to invalidate the precomputed results of a method. The method is recomputed again upon next invocation.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128504195","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}
{"title":"Value-added locking: concurrently supporting transactions and queries in DBMS","authors":"Luis L. Cova, Wei Sun","doi":"10.1109/RIDE.1992.227428","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227428","url":null,"abstract":"This paper presents an approach value-added locking (VAL), that allows effective transaction processing and the execution of complex, read-only, and long-lived queries simultaneously on the same database. VAL integrates the concepts of altruistic locking and quasi-copies to provide a mechanism that allows users, application designers to database administrators to fine-tune the system performance in terms of transaction throughput and queries' average response times. By deploying VAL, a significant gain in system performance may be expected. It also shows that a conventional concurrency control mechanisms such as 2-phase locking becomes a special case of the approach.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130956997","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}