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

Proceedings of the Eleventh International Conference on Data Engineering最新文献

筛选
英文 中文
A transparent object-oriented schema change approach using view evolution 使用视图演化的透明的面向对象模式更改方法
Proceedings of the Eleventh International Conference on Data Engineering Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380396
Young-Gook Ra, Elke A. Rundensteiner
{"title":"A transparent object-oriented schema change approach using view evolution","authors":"Young-Gook Ra, Elke A. Rundensteiner","doi":"10.1109/ICDE.1995.380396","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380396","url":null,"abstract":"When a database is shared by many users, updates to the database schema are almost always prohibited because there is a risk of making existing application programs obsolete when they run against the modified schema. This paper addresses the problem by integrating schema evolution with view facilities. When new requirements necessitate schema updates for a particular user, the user specifies schema changes to the personal view rather than to the shared base schema. Our view evolution approach then computes a new view schema that reflects the semantics of the desired schema change, and replaces the old view with the new one. We present algorithms that implement the set of schema evolution operations typically supported by OODB systems as view definitions. This approach provides the means for schema change without affecting other views (and thus without affecting existing application programs). The persistent data is shared by different views of the schema, i.e., both old as well as newly developed applications can continue to interoperate. In this paper, we present examples that demonstrate our approach.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129999710","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}
引用次数: 63
A similarity graph-based approach to declustering problems and its application towards parallelizing grid files 基于相似图的解簇方法及其在网格文件并行化中的应用
Proceedings of the Eleventh International Conference on Data Engineering Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380370
Duen-Ren Liu, S. Shekhar
{"title":"A similarity graph-based approach to declustering problems and its application towards parallelizing grid files","authors":"Duen-Ren Liu, S. Shekhar","doi":"10.1109/ICDE.1995.380370","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380370","url":null,"abstract":"We propose a new similarity-based technique for declustering data. The proposed method can adapt to available information about query distributions, data distributions, data sizes and partition-size constraints. The method is based on max-cut partitioning of a similarity graph defined over the given set of data, under constraints on the partition sizes. It maximizes the chances that a pair of data-items that are to be accessed together by queries are allocated to distinct disks. We show that the proposed method can achieve optimal speed-up for a query-set, if there exists any other declustering method which will achieve the optimal speed-up. Experiments in parallelizing grid files show that the proposed method outperforms mapping-function-based methods for interesting query distributions as well for non-uniform data distributions.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130863326","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}
引用次数: 39
Improving SQL with generalized quantifiers 使用广义量词改进SQL
Proceedings of the Eleventh International Conference on Data Engineering Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380381
P. Hsu, D. S. Parker
{"title":"Improving SQL with generalized quantifiers","authors":"P. Hsu, D. S. Parker","doi":"10.1109/ICDE.1995.380381","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380381","url":null,"abstract":"A generalized quantifier is a particular kind of operator on sets. Coming under increasing attention recently by linguists and logicians, they correspond to many useful natural language phrases, including phrases like: three, Chamberlin's three, more than three, fewer than three, at most three, all but three, no more than three, not more than half the, at least two and not more than three, no student's, most male and all female, etc. Reasoning about quantifiers is a source of recurring problems for most SQL users, and leads to both confusion and incorrect expression of queries. By adopting a more modern and natural model of quantification these problems can be alleviated. We show how generalized quantifiers can be used to improve the SQL interface.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127902638","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
Toward scalability and interoperability of heterogeneous information sources 面向异构信息源的可伸缩性和互操作性
Proceedings of the Eleventh International Conference on Data Engineering Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380408
S. Dao
{"title":"Toward scalability and interoperability of heterogeneous information sources","authors":"S. Dao","doi":"10.1109/ICDE.1995.380408","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380408","url":null,"abstract":"Future large and complex information systems create new challenges and opportunities for research and advanced development in data management. A brief description of Hughes research and prototype efforts to meet these challenges is summarized.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131849350","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
Generalized partial indexes 广义偏指数
Proceedings of the Eleventh International Conference on Data Engineering Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380355
P. Seshadri, A. Swami
{"title":"Generalized partial indexes","authors":"P. Seshadri, A. Swami","doi":"10.1109/ICDE.1995.380355","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380355","url":null,"abstract":"This paper demonstrates the use of generalized partial indexes for efficient query processing. We propose that partial indexes be built on those portions of the database that are statistically likely to be the most useful for query processing. We identify three classes of statistical information, and two levels at which it may be available. We describe indexing strategies that use this information to significantly improve average query performance. Results from simulation experiments demonstrate that the proposed generalized partial indexing strategies perform well compared to the traditional approach to indexing.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131865010","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}
引用次数: 67
Singapore NII: building the electronic universe 新加坡NII:建立电子宇宙
Proceedings of the Eleventh International Conference on Data Engineering Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380374
M. Yap
{"title":"Singapore NII: building the electronic universe","authors":"M. Yap","doi":"10.1109/ICDE.1995.380374","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380374","url":null,"abstract":"The National Information Infrastructure (NII) is an infrastructure consisting of efficient transport, information processing and service facilities that combine both computer and communication technologies. The needs of business and the public in general drive the definition of the infrastructure. Its goal is to increase the well-being of people as a whole. To deliver the promise of a more effective way to do business, the NII must strive to bring as many of these services or their equivalent to the end-users. Further, these services must be easily accessible and easy to use in addition to being affordable. The NII attempts to (re)engineer the real-world capabilities over the physical telecommunication network. In addition, the NII provides for a rich set of common computing services and supports the reuse of large components, over and above providing a physical telecommunication network.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127686715","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
Design, implementation and evaluation of SCORE (a system for content based retrieval of pictures) SCORE(基于内容的图片检索系统)的设计、实现与评价
Proceedings of the Eleventh International Conference on Data Engineering Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380383
Y. Aslandogan, Chuck Thier, Clement T. Yu, Chengwen Liu, K. R. Nair
{"title":"Design, implementation and evaluation of SCORE (a system for content based retrieval of pictures)","authors":"Y. Aslandogan, Chuck Thier, Clement T. Yu, Chengwen Liu, K. R. Nair","doi":"10.1109/ICDE.1995.380383","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380383","url":null,"abstract":"We make use of a refined E-R model to represent the contents of pictures. We propose remedies to handle mismatches which may arise due to differences in perception of picture contents. An iconic user interface for visual query construction is presented. A naive user can specify his/her intention without learning a query language. A function which computes the similarity between a picture and a user's description is provided. Pictures which are sufficiently close to the user description, as measured by the similarity function, are retrieved. We present the results of a user-friendliness experiment to evaluate the user interface as well as retrieval effectiveness. Encouraging retrieval results and valuable lessons are obtained.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114289338","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}
引用次数: 49
Set-oriented mining for association rules in relational databases 面向集的关系数据库关联规则挖掘
Proceedings of the Eleventh International Conference on Data Engineering Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380413
M. Houtsma, A. Swami
{"title":"Set-oriented mining for association rules in relational databases","authors":"M. Houtsma, A. Swami","doi":"10.1109/ICDE.1995.380413","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380413","url":null,"abstract":"Describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less efficient than special-purpose algorithms. We develop new algorithms that can be expressed as SQL queries, and discuss the optimization of these algorithms. After analytical evaluation, an algorithm named SETM emerges as the algorithm of choice. SETM uses only simple database primitives, viz. sorting and merge-scan join. SETM is simple, fast and stable over the range of parameter values. The major contribution of this paper is that it shows that at least some aspects of data mining can be carried out by using general query languages such as SQL, rather than by developing specialized black-box algorithms. The set-oriented nature of SETM facilitates the development of extensions.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117128770","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}
引用次数: 70
A transaction transformation approach to active rule processing 主动规则处理的事务转换方法
Proceedings of the Eleventh International Conference on Data Engineering Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380402
D. Montesi, Riccardo Torlone
{"title":"A transaction transformation approach to active rule processing","authors":"D. Montesi, Riccardo Torlone","doi":"10.1109/ICDE.1995.380402","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380402","url":null,"abstract":"Describes operational aspects of a novel approach to active rule processing based on a transaction transformation technique. A user-defined transaction, which is viewed as a sequence of atomic database updates forming a semantic unit, is translated by means of active rules into a new transaction that explicitly includes the additional updates due to active rule processing. It follows that the execution of the new transaction in a passive environment corresponds to the execution of the original transaction within the active environment defined by the given rules. Both immediate and deferred execution models are considered. The approach presents two main features. First, it relies on a well known formal basis that allow us to derive solid results on equivalence, confluence and optimization issues. Second, it is easy to implement as it does not require any specific run-time support.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"211 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114018105","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}
引用次数: 18
A uniform framework for integrating knowledge in heterogeneous knowledge systems 异构知识系统中集成知识的统一框架
Proceedings of the Eleventh International Conference on Data Engineering Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380362
Sibel Adali, Ross Emery
{"title":"A uniform framework for integrating knowledge in heterogeneous knowledge systems","authors":"Sibel Adali, Ross Emery","doi":"10.1109/ICDE.1995.380362","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380362","url":null,"abstract":"Integrating knowledge from multiple sources is an important aspect of automated reasoning systems. Wiederhold and his colleagues (1993) have proposed the concept of a mediator-a device that will express how such an integration is to be achieved. In (1994) Subrahmanian et al. presented a uniform declarative and operational framework for mediators for amalgamating multiple knowledge bases and data structures (e.g. relational, object-oriented, spatial, and temporal structures) when these knowledge bases (possibly) contain inconsistencies, uncertainties, and nonmonotonic modes of negation. We specify the programming environment for this framework and show that it can be used to extract and integrate information obtained from different sources of data and resolve conflicts. We also show that it can be extended easily to integrate new knowledge bases.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116389250","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
首页 上一页 下一页 尾页
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学术官方微信
小红书