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

[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing最新文献

筛选
英文 中文
Relaxing serializability in multidatabase systems 放宽多数据库系统中的序列化性
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI: 10.1109/RIDE.1992.227404
S. Mehrotra, R. Rastogi, H. F. Korth, A. Silberschatz
{"title":"Relaxing serializability in multidatabase systems","authors":"S. Mehrotra, R. Rastogi, H. F. Korth, A. Silberschatz","doi":"10.1109/RIDE.1992.227404","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227404","url":null,"abstract":"The concept of serializability has been traditionally accepted as the standard notion of correctness in database systems. However, in a multidatabase system (MDBS), ensuring serializability is a difficult task mainly due to the desire of preserving the autonomy of the participating local database systems. The authors introduce a new notion of correctness, RS-correctness, that is based on preserving the integrity constraints of the database. They present a new protocol for ensuring that schedules in an MDBS environment are RS-correct. The protocol preserves the local autonomy of sites.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"39 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":"126597021","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}
引用次数: 24
Optimization of object-oriented queries using path indices 使用路径索引优化面向对象查询
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI: 10.1109/RIDE.1992.227413
E. Bertino, C. Guglielmina
{"title":"Optimization of object-oriented queries using path indices","authors":"E. Bertino, C. Guglielmina","doi":"10.1109/RIDE.1992.227413","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227413","url":null,"abstract":"This paper addresses the problem of efficiently evaluating nested predicates in object-oriented databases. The authors have previously introduced the notion of path index (E. Bertino et al., 1989) that associates the values of a nested attribute with the instances of the class root of a given aggregation hierarchy. They evaluated the performance of the path index in the case of queries containing a single predicate. Here they consider the usage of the path index in the framework of more general queries containing several predicates.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"43 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":"123057997","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
DVH: a query processing method using domain vectors and hashing DVH:一个使用域向量和哈希的查询处理方法
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI: 10.1109/RIDE.1992.227416
J. Gustafson, W. Perrizo, Kirk Scott, D. Thureen
{"title":"DVH: a query processing method using domain vectors and hashing","authors":"J. Gustafson, W. Perrizo, Kirk Scott, D. Thureen","doi":"10.1109/RIDE.1992.227416","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227416","url":null,"abstract":"The authors introduce a fast, space-efficient technique for accelerating equijoins between very large relations. The technique, called Domain Vector Hash (DVH) join Acceleration, is described and compared with three other join accelerators: hybrid-hash, join indexes, and materialized views. An analytic cost model is developed for each join method, and a detailed analytic performance comparison is made between each technique. The results show that DVH-join produces much faster joins than any of the other techniques considered, and over a considerably wider range of join selectivities and memory sizes. Moreover, the approach achieves this performance improvement while simultaneously minimizing the amount of additional join information that is cached on disk. When compared with either join indexes or materialized views, DVH typically requires from one to four orders of magnitude less cache space.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"51 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":"132351965","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}
引用次数: 4
IPL: the InterBase Parallel Language IPL:基间并行语言
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI: 10.1109/RIDE.1992.227422
O. Bukhres, Jiansan Chen, Jindong Chen, A. Elmagarmid, Y. Leu, Gang Zhu
{"title":"IPL: the InterBase Parallel Language","authors":"O. Bukhres, Jiansan Chen, Jindong Chen, A. Elmagarmid, Y. Leu, Gang Zhu","doi":"10.1109/RIDE.1992.227422","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227422","url":null,"abstract":"IPL is a declarative distributed language designed to support application level programming in the InterBase project. This paper presents the IPL language and shows how it support flexible transactions, mixed transactions, time-constrained transactions and other features. Besides its transaction-oriented features, IPL can be used as a general purpose distributed programming language.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"1 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":"128966520","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}
引用次数: 11
Transaction sequencing problems for maximal parallelism 最大并行的事务排序问题
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI: 10.1109/RIDE.1992.227402
T. Kakeshita, Haiyan Xu
{"title":"Transaction sequencing problems for maximal parallelism","authors":"T. Kakeshita, Haiyan Xu","doi":"10.1109/RIDE.1992.227402","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227402","url":null,"abstract":"The authors define the maximal parallelism scheduling problem and prove that it is NP hard. They examine a special case of the problem and find its nearly optimal solution in the succeeding section. The main techniques for finding an approximate solution are grouping of transactions and defining an order within each group. Moreover they define group of groups (higher level group) and improve approximation using it.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"37 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":"129857020","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
ACTA: a comprehensive transaction framework for extended transactions ACTA:扩展交易的综合交易框架
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI: 10.1109/RIDE.1992.227398
Panos K. Chrysanthis, K. Ramamritham
{"title":"ACTA: a comprehensive transaction framework for extended transactions","authors":"Panos K. Chrysanthis, K. Ramamritham","doi":"10.1109/RIDE.1992.227398","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227398","url":null,"abstract":"Summary form only given. Although powerful, the transaction model adopted in traditional database systems is found lacking in functionality and performance when used for new applications, such as CAD/CAM, and design environments. Various extensions to traditional transaction model have been proposed to address these drawbacks. In order to analyze these ad hoc extensions and in search for a good implementation support for the new applications, the authors have developed a comprehensive transaction framework, called ACTA. ACTA characterizes the semantics of interactions in terms of different types of dependences between transactions and in terms of transactions' effects on objects.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"88 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":"127483223","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}
引用次数: 1
Tuning of striping units in disk-array-based file systems 基于磁盘阵列的文件系统中条带化单元的调优
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI: 10.1109/RIDE.1992.227421
G. Weikum, P. Zabback
{"title":"Tuning of striping units in disk-array-based file systems","authors":"G. Weikum, P. Zabback","doi":"10.1109/RIDE.1992.227421","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227421","url":null,"abstract":"Striping files across the disks of a disk array is a promising approach to improve the I/O performance of data management systems. An important tuning parameter of this method is the striping unit that is, the maximum number of logically consecutive blocks that are allocated on one disk. The striping unit determines the degree of parallelism in servicing a request by multiple disks, and its affects the achievable throughput of I/O requests. Since a good choice of a file's striping unit depends on the file's access characteristics such as average request size, it is proposed that file-specific striping units be chosen rather than choosing the same global striping unit for all files. The paper presents a method for tuning file-specific striping units, based on the access characteristics of the individual files and the throughput requirements of the application. Performance experiments are presented, based on a synthetic benchmark that was run on the file system prototype FIVE and a simulation testbed for disk-arrays. The experiments indicate significant performance gains of file-specific striping units compared to an optimally chosen global striping unit.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"35 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":"133907181","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}
引用次数: 24
Protecting replicated objects against media failures 保护复制对象免受媒体故障的影响
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI: 10.1109/RIDE.1992.227417
Jehan-Francois Pâris, D. Long
{"title":"Protecting replicated objects against media failures","authors":"Jehan-Francois Pâris, D. Long","doi":"10.1109/RIDE.1992.227417","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227417","url":null,"abstract":"Presents a replication control protocol that provides excellent data availabilities while guaranteeing that all writes to the object are recorded in at least two replicas. The protocol, robust dynamic voting (RDV) accepts reads and writes as long as at least replicas remain available. The replicated object remains inaccessible until either the two last available replicas recover or one of the two last available replicas can collect the votes of a majority of replicas. The authors evaluate the read and write availabilities of replicated data objects managed by the RDV protocol and compare them with those of replicated objects managed by majority consensus voting, dynamic voting and hybrid dynamic voting protocols. They show that RDV can provide extra protection against media failures with no significant loss of availability.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"53 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":"115039765","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}
引用次数: 1
An intelligent page store for concurrent transaction and query processing 用于并发事务和查询处理的智能页面存储
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI: 10.1109/RIDE.1992.227429
D. Dias, A. Goyal, F. Parr
{"title":"An intelligent page store for concurrent transaction and query processing","authors":"D. Dias, A. Goyal, F. Parr","doi":"10.1109/RIDE.1992.227429","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227429","url":null,"abstract":"An intelligent page store is proposed that provides two paths for accessing data. Update and transaction traffic are presented the current version of the data by the page store. Complex queries against the same data are presented a recent transaction consistent snapshot of the data. Periodically, new snapshots are created for access by new queries. By using an implicit versioning scheme, the page store maintains one copy of most of the data, while providing consistent access. This scheme allows the transaction and query systems to be independently optimized. The authors show that transaction performance is largely unaffected by concurrent queries, and disks are used efficiently since a query copy of the database is obviated.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"102 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":"129029284","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
Class reference reduction in object-oriented databases 面向对象数据库中的类引用减少
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing Pub Date : 1992-02-02 DOI: 10.1109/RIDE.1992.227399
Wei Sun, Luis L. Cova
{"title":"Class reference reduction in object-oriented databases","authors":"Wei Sun, Luis L. Cova","doi":"10.1109/RIDE.1992.227399","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227399","url":null,"abstract":"The authors propose a semantic query-optimizer (SQO) using semantic integrity constraints (SICs) in an object-oriented database system (OODB). SICs assert permissible or consistent database states (a database state is the stored data at a given time instance) for a database application. For example, in a payroll database, the minimum hourly rate has to be $4.35 by law. The basic idea of SQO is to optimize queries by transforming a query qualification into another semantically equivalent one using semantic integrity constraints such that evaluating the transformed query would be less costly. Although semantic query optimization has been well studied in the context of relational and deductive database systems, certain distinct object-oriented features such as IS-A class hierarchy have not been taken into consideration. This is probably due to that OODB is relatively new and that there is lack of research so far on SICs in OODBs.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"19 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":"134424326","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学术官方微信