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

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

筛选
英文 中文
Algorithms for handling skew in parallel task scheduling 并行任务调度中处理倾斜的算法
[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.227423
A. Swami, H. Young, Ashish Gupta
{"title":"Algorithms for handling skew in parallel task scheduling","authors":"A. Swami, H. Young, Ashish Gupta","doi":"10.1109/RIDE.1992.227423","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227423","url":null,"abstract":"Presents two new algorithms, the LPT-MinHeight (LPTMH) algorithm and the Split-LPT (SLPT) algorithm, for handling skew in parallel task scheduling. Both algorithms are based on the LPT (Largest Processing Time first) algorithm. The worst case imbalance for the LPTMH algorithm never exceeds 1/(e-1)<or=0.582, while the worst case imbalance for the SLPT algorithm is (p-1)/(p+1)<1. Both LPTMH and SLPT take make less running time than other competing algorithms. Results of experiments show that the SLPT algorithm performs better on the average than the LPTMH algorithm and as well as other known algorithms. A concrete example of the PITS problem arises when the database join operation is parallelized. The join is an important but expensive operation in relational systems and significant improvements in response time may be attained by parallelizing the join.<<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":"116101959","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
A probabilistic approach to query processing in heterogeneous database 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.227408
F. S. Tseng, Arbee L. P. Chen, Wei-Pang Yang
{"title":"A probabilistic approach to query processing in heterogeneous database systems","authors":"F. S. Tseng, Arbee L. P. Chen, Wei-Pang Yang","doi":"10.1109/RIDE.1992.227408","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227408","url":null,"abstract":"In heterogeneous database systems, partial values can be used to resolve the interoperability problems, including domain mismatch, inconsistent data, and missing data. Performing operations on partial values may produce maybe tuples in the query result which cannot be compared. Thus, users have no way to distinguish which maybe tuple is the most possible answer. The concept of partial values is generalized to probabilistic partial values. The authors develop a full set of extended relational operators for manipulating relations containing probabilistic partial values. With this approach, the uncertain answer tuples of a query are associated with degrees of uncertainty. That provides users a comparison among maybe tuples and a better understanding on the query results. Besides, extended selection and join are generalized to alpha -selection and alpha -join, respectively, which can be used to filter out may be tuples with low possibilities-those which have possibilities smaller than alpha .<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"34 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":"115073161","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}
引用次数: 29
A deadlock checkpointing scheme for 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.227407
P. Scheuermann, Hsiang-Lung Tung
{"title":"A deadlock checkpointing scheme for multidatabase systems","authors":"P. Scheuermann, Hsiang-Lung Tung","doi":"10.1109/RIDE.1992.227407","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227407","url":null,"abstract":"A multidatabase system (MDBS) is a software package that integrates a number of pre-existing, autonomous and heterogeneous local database systems (LDBS). Deadlock detection and resolution in MDBS is much more difficult than in traditional distributed database systems due to the autonomy requirement which implies that LDBSs cannot exchange any control information. The authors present an efficient periodic deadlock detection and resolution scheme for MDBS which allows for the concurrent execution of global transactions at multiple sites. The authors scheme employs a depth-first search of a bipartite graph called the transaction-block-at site graph (TBSG).<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"112 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":"127564456","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}
引用次数: 8
Using PRIMA-DBMS as a testbed for parallel complex-object processing 使用PRIMA-DBMS作为并行复杂对象处理的测试平台
[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.227426
Christoph Hübel, B. Mitschang, Michael Gesmann, Andreas Grasnickel, W. Käfer, Harald Schöning, T. Härder
{"title":"Using PRIMA-DBMS as a testbed for parallel complex-object processing","authors":"Christoph Hübel, B. Mitschang, Michael Gesmann, Andreas Grasnickel, W. Käfer, Harald Schöning, T. Härder","doi":"10.1109/RIDE.1992.227426","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227426","url":null,"abstract":"The PRIMA-DBMS approach is explained by introducing PRIMA's architecture and query processing framework. The PRIMA-DBMS constitutes a testbed that is flexible enough to support evaluation and validation of quite a variation of different strategies for complex-object processing taking into account different parallelization levels an different hardware environments. Thus, PRIMA marks and important step towards the authors' main research goal concerning measures for efficient complex-object processing: the measures that are in competition with each other are query optimization, query evaluation strategies, and massive storage, that all benefit from parallelism. The programming environment that supports the parallel DBMS processing is introduced with special emphasis on its ability for parametrization and configuration. A case study of the PRIMA testbed illustrates their first investigations and demonstrates a methodology for evaluation and tuning of PRIMA configurations.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"45 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":"115288425","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
Query performance evaluation of a relational DBMS 关系型DBMS的查询性能评估
[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.227396
Øystein Grøvlen, Ø. Trier
{"title":"Query performance evaluation of a relational DBMS","authors":"Øystein Grøvlen, Ø. Trier","doi":"10.1109/RIDE.1992.227396","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227396","url":null,"abstract":"This paper presents a study of query performance in Oracle RDBMS. The test results show that for low selectivity selection queries, indexes are of no help. It is also shown that when joining large parts of tables, sort-merge join performs better than indexed join.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"22 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":"125050045","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
Less optimism about optimistic concurrency control 对乐观并发控制不太乐观
[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.227405
C. Mohan
{"title":"Less optimism about optimistic concurrency control","authors":"C. Mohan","doi":"10.1109/RIDE.1992.227405","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227405","url":null,"abstract":"This paper discusses some of the shortcomings of the optimistic concurrency control (OCC) approach in supporting all the features expected in a full-function DBMS. Surprisingly, in spite of OCC having been around for a long time and its performance having been studied in various contexts, no complete system design, let alone a full-blown implementation, exists, as far as the author knows. The problems with OCC relate to support for access paths (indexes, hash-based storage), partial rollbacks, nested transactions, fine-granularity (e.g. record-level) conflict checking, different isolation levels, distributed transactions, and so on. this paper increases-awareness of the implementation aspects of OCC amongst researchers and initiates a debate about the practical utility of OCC.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"50 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":"123985795","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}
引用次数: 27
Embedding MSQL queries into a logic based transaction processing framework 将sql查询嵌入到基于逻辑的事务处理框架中
[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.227412
E. Kühn, F. Puntigam
{"title":"Embedding MSQL queries into a logic based transaction processing framework","authors":"E. Kühn, F. Puntigam","doi":"10.1109/RIDE.1992.227412","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227412","url":null,"abstract":"The processing of multidatabase transactions requires not only a powerful non procedural user language to express a query on several databases but also the possibility to specify the execution control of such queries. This paper shows how transaction control can be added to MSQL queries. A minimal set of language primitives is combined with the VPL (Vienna Parallel logic) language so that the dynamic formulation of MSQL queries with explicit control specification is supported.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"8 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":"124019692","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
Interactions between query optimization and concurrency control 查询优化和并发控制之间的交互
[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.227427
C. Mohan
{"title":"Interactions between query optimization and concurrency control","authors":"C. Mohan","doi":"10.1109/RIDE.1992.227427","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227427","url":null,"abstract":"The author argues the importance of and need for taking into consideration concurrency control related issues in making query optimization and query processing decisions. Such considerations are very important not only for attaining good performance, but also for assuring the correctness of the results returned to the users under certain circumstances. Some of the topics that they deal with include degrees of consistency or isolation levels (repeatable read, cursor stability, . . .), lock escalation, blocking of results and use of multiple indexes for a single table access (i.e. index AND/ORing). They identify some of the pieces of information relating to locking that must be available to the optimizer for it to make intelligent decisions. They also identify some situations in which locking can be avoided by taking advantage of the isolation level of the query being executed.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"91 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":"131457879","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}
引用次数: 20
Chain-based evaluation-a bridge linking recursive and nonrecursive query evaluation 基于链的求值——连接递归和非递归查询求值的桥梁
[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.227414
Jiawei Han
{"title":"Chain-based evaluation-a bridge linking recursive and nonrecursive query evaluation","authors":"Jiawei Han","doi":"10.1109/RIDE.1992.227414","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227414","url":null,"abstract":"Many recursive query analysis techniques are qualitative in nature. This contracts sharply with relational query optimization which relies heavily on quantitative analysis. This paper shows that chain-based evaluation facilitates quantitative analysis of recursive queries based on the available chain information, database statistics and other quantitative measurements. Chain-based evaluation not only facilitates binding propagation, constraint pushing and the selection of recursive query evaluation algorithms but also provides precise compile chain forms in relational expressions. Since most recursions in database applications can be compiled into highly regular chain forms, chain-based evaluation is promising at bridging recursive and nonrecursive database query evaluation.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"46 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":"133072338","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
The Papyrus query processing engine Papyrus查询处理引擎
[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.227425
Tim Connors, Donovan A. Schneider
{"title":"The Papyrus query processing engine","authors":"Tim Connors, Donovan A. Schneider","doi":"10.1109/RIDE.1992.227425","DOIUrl":"https://doi.org/10.1109/RIDE.1992.227425","url":null,"abstract":"This paper describes query processing in the Papyrus integrated data server. Query processing is unique in Papyrus because the underlying language is very powerful (computationally complete), performance on uni-processor systems is not sacrificed in order to support multiprocessor architectures, and queries are self-scheduling in order to support extensibility. A prototype demonstrating the feasibility of this approach is in operation.<<ETX>>","PeriodicalId":138660,"journal":{"name":"[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing","volume":"21 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":"134479438","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
下一页 尾页
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学术官方微信