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

Proceedings of 1994 IEEE 10th International Conference on Data Engineering最新文献

筛选
英文 中文
A hybrid transitive closure algorithm for sequential and parallel processing 一种用于顺序和并行处理的混合传递闭包算法
Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283073
Qi Yang, Clement T. Yu, Chengwen Liu, S. Dao, Gaoming Wang, Tracy Pham
{"title":"A hybrid transitive closure algorithm for sequential and parallel processing","authors":"Qi Yang, Clement T. Yu, Chengwen Liu, S. Dao, Gaoming Wang, Tracy Pham","doi":"10.1109/ICDE.1994.283073","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283073","url":null,"abstract":"A new hybrid algorithm is proposed for well-formed path problems including the transitive closure problem. The CPU time for computation is O(ne), and blocking technique is incorporated to reduce the disk I/O cost in disk-resident environment. The new features of the new algorithm are that only parents sets instead of descendant sets are loaded in from disk, and the computation can be parallelized efficiently. Simulation results show that our algorithm is superior to other existing algorithms in sequential computation, and that linear speedup is achieved in parallel computation.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129764969","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
Performing group-by before join /spl lsqb/query processing/spl rsqb/ join前执行group-by /spl lsqb/查询处理/spl rsqb/
Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283001
Weipeng P. Yan, P. Larson
{"title":"Performing group-by before join /spl lsqb/query processing/spl rsqb/","authors":"Weipeng P. Yan, P. Larson","doi":"10.1109/ICDE.1994.283001","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283001","url":null,"abstract":"Assume that we have an SQL query containing joins and a group-by. The standard way of evaluating this type of query is to first perform all the joins and then the group-by operation. However, it may be possible to perform the group-by early, that is, to push the group-by operation past one or more joins. Early grouping may reduce the query processing cost by reducing the amount of data participating in joins. We formally define the problem, adhering strictly to the semantics of NULL and duplicate elimination in SQL2, and prove necessary and sufficient conditions for deciding when this transformation is valid. In practice, it may be expensive or even impossible to test whether the conditions are satisfied. Therefore, we also present a more practical algorithm that tests a simpler, sufficient condition. This algorithm is fast and detects a large subclass of transformable queries.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134474065","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
A multi-set extended relational algebra: a formal approach to a practical issue 多集扩展关系代数:解决实际问题的形式化方法
Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283002
P. Grefen, R. A. By
{"title":"A multi-set extended relational algebra: a formal approach to a practical issue","authors":"P. Grefen, R. A. By","doi":"10.1109/ICDE.1994.283002","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283002","url":null,"abstract":"The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples an a relation. Many database languages and systems do require multi-set semantics though, either because of functional requirements or because of the high costs of duplicate removal in database operations. Several proposals have been presented that discuss multi-set semantics. As these proposals tend to be either rather practical, lacking the formal background, or rather formal, lacking the connection to database practice, the gap between theory and practice has not been spanned yet. This paper proposes a complete extended relational algebra with multi-set semantics, having a clear formal background and a close connection to the standard relational algebra. It includes constructs that extend the algebra to a complete sequential database manipulation language that can either be used as a formal background to other multi-set languages like SQL, or as a database manipulation language on its own. The practical usability of the latter option has been demonstrated in the PRISMA/DB database project, where a variant of the language has been used as the primary database language.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128023682","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}
引用次数: 56
Specification and management of extended transactions in a programmable transaction environment 可编程事务环境中扩展事务的规范和管理
Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283069
Dimitrios Georgakopoulos, M. Hornick, Piotr Krychniak, F. Manola
{"title":"Specification and management of extended transactions in a programmable transaction environment","authors":"Dimitrios Georgakopoulos, M. Hornick, Piotr Krychniak, F. Manola","doi":"10.1109/ICDE.1994.283069","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283069","url":null,"abstract":"A Transaction Specification and Management Environment (TSME) is a transaction processing system toolkit that supports the definition and construction of application-specific extended transaction models (ETMs). The TSME provides a transaction specification language that allows a transaction model designer to create implementation-independent specifications of extended transactions. In addition, the TSME provides a programmable transaction management mechanism that assembles and configures a run-time environment to support specified ETMs. The authors discuss the TSME in the context of a distributed object management system (DOMS), and describe specifications of extended transactions and corresponding configurations of transaction management mechanisms.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128900309","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}
引用次数: 98
Parallel approaches to database management 数据库管理的并行方法
Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283060
D. Reiner
{"title":"Parallel approaches to database management","authors":"D. Reiner","doi":"10.1109/ICDE.1994.283060","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283060","url":null,"abstract":"Abstract only given, as follows. A variety of parallel approaches have been used to support database processing across a spectrum of machine architectures. We begin by describing areas where parallelism is potentially important in dealing with very large databases, including loading, query/update, and database administration. We then discuss hardware tradeoffs, including multicomputers versus multiprocessors, distributed versus centralized memory, and specialised versus general-purpose architectures. At the software level, we cover a number of approaches, including running multiple transactions in parallel, decomposing queries into parallel subqueries, executing low-level query operations in parallel, running multiple instances of the DBMS, and partitioning data over disks. We characterise the impact of these approaches on performance, scalability, and ease of use, for both decision support and transaction processing. Finally, the approaches taken in several commercial DBMSs are described, as well as extensions such as the Kendall Square Query Decomposer.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124392044","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
Object Skeletons: an efficient navigation structure for object-oriented database systems 对象骨架:面向对象数据库系统的有效导航结构
Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283075
K. Hua, Chinmoy Tripathy
{"title":"Object Skeletons: an efficient navigation structure for object-oriented database systems","authors":"K. Hua, Chinmoy Tripathy","doi":"10.1109/ICDE.1994.283075","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283075","url":null,"abstract":"One common requirement of object-oriented applications is the efficient support of complex objects. This requirement is one salient feature of object orientation. Access to a complex object involves true basic steps: (1) The predicate is evaluated to identify the complex object. (2) The qualified complex object is traversed to retrieve the required components. Over the past few years, several indexing schemes have been developed to support step 1. However, support structures for the efficient execution of step 2 has received little attention. To address this problem, we propose, in this paper, using networks of unique object identifiers (Object Skeletons) as a navigational structure to aid query processing of complex objects. In this approach, skeletons of complex objects contain only the semantic information. Once a skeleton has been loaded into memory, navigation along the complex object can be done with no further disk access. Furthermore, since the descriptive information of an object is stored separately from its object identifier, it is free to migrate anywhere in the database. To assess the efficiency of this approach, we built a prototype and compared its performance to some recently proposed indexing schemes. The results of our study indicate that this technique can provide very impressive savings of both space and time.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127757828","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}
引用次数: 16
The TP-Index: a dynamic and efficient indexing mechanism for temporal databases TP-Index:一种动态、高效的时态数据库索引机制
Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283041
Han Shen, B. Ooi, Hongjun Lu
{"title":"The TP-Index: a dynamic and efficient indexing mechanism for temporal databases","authors":"Han Shen, B. Ooi, Hongjun Lu","doi":"10.1109/ICDE.1994.283041","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283041","url":null,"abstract":"To support temporal operators efficiently, indexing based on temporal attributes must be supported. The authors propose a dynamic and efficient index scheme called the time polygon (TP-index) for temporal databases. In the scheme, temporal data are mapped into a two-dimensional temporal space, where the data can be clustered based on time. The date space is then partitioned into time polygons where each polygon corresponds to a data page. The time polygon directory can be organized as a hierarchical index. The index handles long duration temporal data elegantly and efficiently. The performance analysis indicates that the time polygon index is efficient both in storage utilization and query search.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"1997 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116684873","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}
引用次数: 59
Efficient evaluation of the valid-time natural join 有效地评估有效时的自然连接
Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283042
M. D. Soo, R. Snodgrass, Christian S. Jensen
{"title":"Efficient evaluation of the valid-time natural join","authors":"M. D. Soo, R. Snodgrass, Christian S. Jensen","doi":"10.1109/ICDE.1994.283042","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283042","url":null,"abstract":"Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the optimization of joins with equality predicates, rather than the inequality predicates prevalent in valid-time queries. Second, the presence of temporally-varying data dramatically increases the size of the database. These factors require new techniques to efficiently evaluate valid-time joins. The authors address this need for efficient join evaluation in databases supporting valid-time. A new temporal-join algorithm based on tuple partitioning is introduced. This algorithm avoids the quadratic cost of nested-loop evaluation methods; it also avoids sorting. Performance comparisons between the partition-based algorithm and other evaluation methods are provided. While the paper focuses on the important valid-time natural join, the techniques presented are also applicable to other valid-time joins.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121206204","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}
引用次数: 92
Supporting data mining of large databases by visual feedback queries 支持通过视觉反馈查询对大型数据库进行数据挖掘
Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283045
D. Keim, H. Kriegel, T. Seidl
{"title":"Supporting data mining of large databases by visual feedback queries","authors":"D. Keim, H. Kriegel, T. Seidl","doi":"10.1109/ICDE.1994.283045","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283045","url":null,"abstract":"Describes a query system that provides visual relevance feedback in querying large databases. The goal is to support the process of data mining by representing as many data items as possible on the display. By arranging and coloring the data items as pixels according to their relevance for the query, the user gets a visual impression of the resulting data set. Using an interactive query interface, the user may change the query dynamically and receives immediate feedback by the visual representation of the resulting data set. Furthermore, by using multiple windows for different parts of a complex query, the user gets visual feedback for each part of the query and, therefore, may easier understand the overall result. The system allows one to represent the largest amount of data that can be visualized on current display technology, provides valuable feedback in querying the database, and allows the user to find results which would otherwise remain hidden in the database.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125201426","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}
引用次数: 72
Object allocation in distributed databases and mobile computers 分布式数据库和移动计算机中的对象分配
Proceedings of 1994 IEEE 10th International Conference on Data Engineering Pub Date : 1994-02-14 DOI: 10.1109/ICDE.1994.283007
Yixiu Huang, O. Wolfson
{"title":"Object allocation in distributed databases and mobile computers","authors":"Yixiu Huang, O. Wolfson","doi":"10.1109/ICDE.1994.283007","DOIUrl":"https://doi.org/10.1109/ICDE.1994.283007","url":null,"abstract":"This paper makes two contributions. First, we introduce a model for evaluating the performance of data allocation and replication algorithms in distributed databases. The model is comprehensive in the sense that it accounts for I/O cost, for communication cost, and for limits on the minimum number of copies of the object (to ensure availability). The second contribution of this paper is the introduction and analysis of an algorithm for automatic dynamic allocation of replicas to processors. Using the new model, we compare the performance of the traditional read-one-write-all static allocation algorithm, to the performance of the dynamic allocation algorithm. As a result, we obtain the relationship between the communication cost and I/O cost for which static allocation is superior to dynamic allocation, and the relationships for which dynamic allocation is superior.<<ETX>>","PeriodicalId":142465,"journal":{"name":"Proceedings of 1994 IEEE 10th International Conference on Data Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129869963","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}
引用次数: 30
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信