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

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

筛选
英文 中文
PICSDESK: a case study in business re-engineering PICSDESK:业务重组的案例研究
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492177
Manolis M. Tsangaris, Madhur Kohli, S. Naqvi, R. Nunziata, Yatin P. Saraiya
{"title":"PICSDESK: a case study in business re-engineering","authors":"Manolis M. Tsangaris, Madhur Kohli, S. Naqvi, R. Nunziata, Yatin P. Saraiya","doi":"10.1109/ICDE.1996.492177","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492177","url":null,"abstract":"Presents first-hand experiences from an actual re-engineering project. Business re-engineering is a process affecting not only the software system involved, but the underlying business model as well. Indeed, it is the changed business model along with the new technologies that determine the design of the new system. This paper is a walkthrough of the design of PICSDESK, a prototype incorporating some modern technologies to support the old business model of its predecessor and its evolution to a new business model. PICSDESK may be thought of as an example of a new breed of inventory control systems.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114401299","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
Search and ranking algorithms for locating resources on the World Wide Web 用于在万维网上定位资源的搜索和排序算法
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492102
B. Yuwono, Lee
{"title":"Search and ranking algorithms for locating resources on the World Wide Web","authors":"B. Yuwono, Lee","doi":"10.1109/ICDE.1996.492102","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492102","url":null,"abstract":"Applying information retrieval techniques to the World Wide Web (WWW) environment is a challenge, mostly because of its hypertext/hypermedia nature and the richness of the meta-information it provides. We present four keyword-based search and ranking algorithms for locating relevant WWW pages with respect to user queries. The first algorithm, Boolean Spreading Activation, extends the notion of word occurrence in the Boolean retrieval model by propagating the occurrence of a query word in a page to other pages linked to it. The second algorithm, Most-cited, uses the number of citing hyperlinks between potentially relevant WWW pages to increase the relevance scores of the referenced pages over the referencing pages. The third algorithm, TFxIDF vector space model, is based on word distribution statistics. The last algorithm, Vector Spreading Activation, combines TFxIDF with the spreading activation model. We conducted an experiment to evaluate the retrieval effectiveness of these algorithms. From the results of the experiment, we draw conclusions regarding the nature of the WWW environment with respect to document ranking strategies.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122021374","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}
引用次数: 93
Maintenance of discovered association rules in large databases: an incremental updating technique 维护大型数据库中发现的关联规则:一种增量更新技术
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492094
D. Cheung, Jiawei Han, V. Ng, C. Y. Wong
{"title":"Maintenance of discovered association rules in large databases: an incremental updating technique","authors":"D. Cheung, Jiawei Han, V. Ng, C. Y. Wong","doi":"10.1109/ICDE.1996.492094","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492094","url":null,"abstract":"An incremental updating technique is developed for maintenance of the association rules discovered by database mining. There have been many studies on efficient discovery of association rules in large databases. However, it is nontrivial to maintain such discovered rules in large databases because a database may allow frequent or occasional updates and such updates may not only invalidate some existing strong association rules but also turn some weak rules into strong ones. An incremental updating technique is proposed for efficient maintenance of discovered association rules when new transaction data are added to a transaction database.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"69 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113978488","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}
引用次数: 915
Authorization and access control in IRO-DB IRO-DB中的授权和访问控制
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492087
W. Eßmayr, F. Kastner, G. Pernul, S. Preishuber, A. Tjoa
{"title":"Authorization and access control in IRO-DB","authors":"W. Eßmayr, F. Kastner, G. Pernul, S. Preishuber, A. Tjoa","doi":"10.1109/ICDE.1996.492087","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492087","url":null,"abstract":"The paper describes authorization and access control in the IRO-DB database system, a system supporting interoperable access between relational and object oriented databases. The security policy developed is a federated administrative discretionary access control policy which supports positive, negative, as well as implied authorization, includes a procedure for conflict resolution within the set of specified authorization rules, and concentrates on role based security.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125603722","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}
引用次数: 26
A proposed method for creating VCR functions using MPEG streams 提出了一种利用MPEG流创建VCR函数的方法
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492186
David B. Andersen
{"title":"A proposed method for creating VCR functions using MPEG streams","authors":"David B. Andersen","doi":"10.1109/ICDE.1996.492186","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492186","url":null,"abstract":"The development of video-on-demand (VOD) systems for movie delivery requires that the user be able to perform VCR functions over a broadband network system. These functions include Play, Pause, Fast Forward, and Fast Rewind. No standard method exists between content developers, server manufacturers and client applications to provide these functions. This paper proposes a standard method for implementing these functions using MPEG streams and discusses some of the important tradeoffs. The encoding and distribution of content has become one of the most important issues facing video information providers. Today, in the case of movies, every service provider must encode the material for the specific equipment being deployed in the network. Therefore, the ease of use and speed of the algorithms employed to encode the material are extremely important. In the future, the creator of the content may encode the material once and distribute it to the service providers in compressed form, but this is not the case today due to the lack of standards.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132752267","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
Tioga-2: a direct manipulation database visualization environment Tioga-2:一个直接操作的数据库可视化环境
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492109
A. Aiken, Jolly Chen, M. Stonebraker, Allison Woodruff
{"title":"Tioga-2: a direct manipulation database visualization environment","authors":"A. Aiken, Jolly Chen, M. Stonebraker, Allison Woodruff","doi":"10.1109/ICDE.1996.492109","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492109","url":null,"abstract":"The paper reports on user experience with Tioga, a DBMS centric visualization tool developed at Berkeley. Based on this experience, we have designed Tioga-2 as a direct manipulation system that is more powerful and much easier to program. A detailed design of the revised system is presented, together with an extensive example of its application.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132259779","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}
引用次数: 107
A uniform indexing scheme for object-oriented databases 面向对象数据库的统一索引方案
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492112
E. Gudes
{"title":"A uniform indexing scheme for object-oriented databases","authors":"E. Gudes","doi":"10.1109/ICDE.1996.492112","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492112","url":null,"abstract":"The performance of object oriented databases (OODB) is a critical factor hindering their current use. Several indexing schemes have been proposed in the literature for enhancing OODB performance and they are briefly reviewed here. A new and uniform indexing scheme is proposed. This scheme is based on a single B tree and combines both the hierarchical and nested indexing schemes (E. Bertino and W. Kim, 1989; W. Kim, 1990). The uniformity of this scheme enables compact and optimized code dealing with a large range of queries on the one hand, and flexibility in adding and removing indexed paths on the other hand. The performance of the scheme is about the same as existing schemes for single class, exact match or range queries, and much better for multi class and other complex queries and update.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116651266","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}
引用次数: 15
Hypermedia database "Himotoki", and its applications 超媒体数据库“Himotoki”及其应用
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492185
Y. Hara, K. Hirata, H. Takano, S. Kawasaki
{"title":"Hypermedia database \"Himotoki\", and its applications","authors":"Y. Hara, K. Hirata, H. Takano, S. Kawasaki","doi":"10.1109/ICDE.1996.492185","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492185","url":null,"abstract":"Describes the design concept of a hypermedia database called \"Himotoki\" and its navigational capabilities. A hypermedia database is a system that integrates hypermedia operations with database models. Its advantages are: (a) its structured design can improve authoring and browsing capabilities for large hypermedia applications, (b) nodes and links can be automatically generated under certain conditions, (c) a navigational data interface for DBMS is obtained, etc. To provide cost-effective operations for hypermedia databases, we introduce set-to-set linking and navigational functions, viz. media-based navigation, schema navigation and moving hot-spot navigation. These functional capabilities make the media contents well-organized, so as to improve the human-machine interactive interface. Implemented applications such as \"Electronic Aquatic Life\" and \"Hypermedia Museum\" demonstrate the usefulness of Himotoki's navigational functions and the customizability of its architectural design.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"4 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116662676","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
Performance analysis of several algorithms for processing joins between textual attributes 几种文本属性连接处理算法的性能分析
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492214
W. Meng, Clement T. Yu, Wei Wang, N. Rishe
{"title":"Performance analysis of several algorithms for processing joins between textual attributes","authors":"W. Meng, Clement T. Yu, Wei Wang, N. Rishe","doi":"10.1109/ICDE.1996.492214","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492214","url":null,"abstract":"Three algorithms for processing joins on attributes of a textual type are presented and analyzed in this paper. Since such joins often involve document collections of very large size, it is very important to find efficient algorithms to process them. The three algorithms differ according to whether the documents themselves or the inverted files on the documents are used to process the join. Our analysis and simulation results indicate that the relative performance of these algorithms depends on the input document collections, the system characteristics and the input query. For each algorithm, the type of input document collection with which the algorithm is likely to perform well is identified.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124838214","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
Parallel pointer-based join algorithms in memory mapped environments 内存映射环境中基于指针的并行连接算法
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492115
P. Buhr, Anil K. Goel, N. Nishimura, P. Ragde
{"title":"Parallel pointer-based join algorithms in memory mapped environments","authors":"P. Buhr, Anil K. Goel, N. Nishimura, P. Ragde","doi":"10.1109/ICDE.1996.492115","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492115","url":null,"abstract":"Three pointer based parallel join algorithms are presented and analyzed for environments in which secondary storage is made transparent to the programmer through memory mapping. P.A. Buhr et al. (1992) show that data structures such as B Trees, R Trees and graph data structures can be implemented as efficiently and effectively in this environment as in a traditional environment using explicit I/O. We show how higher order algorithms, in particular parallel join algorithms, behave in a memory mapped environment. A quantitative analytical model has been developed to conduct performance analysis of the parallel join algorithms. The model has been validated by experiments.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125492384","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
首页 上一页 下一页 尾页
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学术官方微信