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

Proceedings 14th International Conference on Data Engineering最新文献

筛选
英文 中文
ROL: a prototype for deductive object-oriented databases 演绎面向对象数据库的原型
Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655823
Mengchi Liu, Weidong Yu, M. Guo, Riqiang Shan
{"title":"ROL: a prototype for deductive object-oriented databases","authors":"Mengchi Liu, Weidong Yu, M. Guo, Riqiang Shan","doi":"10.1109/ICDE.1998.655823","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655823","url":null,"abstract":"Summary form only given. ROL (Rule-based Object Language) is a deductive object-oriented database system. It provides a uniform language for defining, querying and manipulating a database. The ROL language integrates important features of deductive databases and object-oriented databases with well-defined declarative semantics. ROL also supports structured values, treating them as first-class citizens, and providing powerful mechanisms for representing both partial and complete information about sets. As a result, it directly supports non-first normal form relations and is an extension of pure value-oriented deductive database languages. A ROL database consists of three parts: a schema, a set of facts and a set of rules. The ROL system is organized into three layers: (1) the user interface (textual and graphical); (2) the query manager and the update manager; and (3) the memory manager and the object manager.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134620417","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
Online generation of association rules 联机生成关联规则
Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655803
C. Aggarwal, Philip S. Yu
{"title":"Online generation of association rules","authors":"C. Aggarwal, Philip S. Yu","doi":"10.1109/ICDE.1998.655803","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655803","url":null,"abstract":"We have a large database consisting of sales transactions. We investigate the problem of online mining of association rules in this large database. We show how to preprocess the data effectively in order to make it suitable for repeated online queries. The preprocessing algorithm takes into account the storage space available. We store the preprocessed data in such a way that online processing may be done by applying a graph theoretic search algorithm whose complexity is proportional to the size of the output. This results in an online algorithm which is practically instantaneous in terms of response time. The algorithm also supports techniques for quickly discovering association rules from large item sets. The algorithm is capable of finding rules with specific items in the antecedent or consequent. These association rules are presented in a compact form, eliminating redundancy. We believe that the elimination of redundancy in online generation of association rules from large item sets is interesting in its own right.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132139452","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}
引用次数: 150
A tightly-coupled architecture for data mining 用于数据挖掘的紧密耦合架构
Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655794
Rosa Meo, G. Psaila, S. Ceri
{"title":"A tightly-coupled architecture for data mining","authors":"Rosa Meo, G. Psaila, S. Ceri","doi":"10.1109/ICDE.1998.655794","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655794","url":null,"abstract":"Current approaches to data mining are based on the use of a decoupled architecture, where data are first extracted from a database and then processed by a specialized data mining engine. This paper proposes instead a tightly-coupled architecture, where data mining is integrated within a classical SQL server. The premise of this work is a SQL-like operator, called MINE RULE. We show how the various syntactic features of the operator can be managed by either a SQL engine or a classical data mining engine; our main objective is to identify the border between typical relational processing, executed by the relational server, and data mining processing, executed by a specialized component. The resulting architecture exhibits portability at the SQL level and integration of inputs and outputs of the data mining operator with the database, and provides the guidelines for promoting the integration of other data mining techniques and systems with SQL servers.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133015836","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
Safeguarding and charging for information on the Internet 保护互联网上的信息并对其收费
Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655776
H. Garcia-Molina, Steven P. Ketchpel, N. Shivakumar
{"title":"Safeguarding and charging for information on the Internet","authors":"H. Garcia-Molina, Steven P. Ketchpel, N. Shivakumar","doi":"10.1109/ICDE.1998.655776","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655776","url":null,"abstract":"With the growing acceptance of the Internet as a new dissemination medium, several new and interesting challenges arise in building a digital commerce infrastructure. We discuss some of the issues that arise in building such an infrastructure. In particular, we study how one can find and pay for digital information, and how one can safeguard the information from invalid access and duplication. We use examples from our Stanford Digital Library Project to illustrate some of these problems and their potential solutions.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116685079","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}
引用次数: 35
Cost and imprecision in modeling the position of moving objects 运动物体位置建模的成本和不精确
Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655822
O. Wolfson, S. Chamberlain, S. Dao, Liqin Jiang, Gisela Mendez
{"title":"Cost and imprecision in modeling the position of moving objects","authors":"O. Wolfson, S. Chamberlain, S. Dao, Liqin Jiang, Gisela Mendez","doi":"10.1109/ICDE.1998.655822","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655822","url":null,"abstract":"Consider a database that represents the location of moving objects, such as taxi-cabs (typical query: \"retrieve the cabs that are currently within 1 mile of 33 Michigan Ave., Chicago\"), or objects in a battle-field. Existing database management systems (DBMSs) are not well equipped to handle continuously changing data, such as the position of moving objects, since data is assumed to be constant unless it is explicitly modified. In this paper, we address position-update policies and imprecision. Assuming that the actual position of a moving object m deviates from the position computed by the DBMS, when should m update its position in the database in order to eliminate the deviation? Furthermore, how can the DBMS provide a bound on the error (i.e. the deviation) when it replies to a query, such as: \"what is the current position of m?\" We propose a cost-based approach to update policies that answers both questions. We develop several update policies and analyze them theoretically and experimentally.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126917860","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}
引用次数: 200
Concurrent operations in a distributed and mobile collaborative environment 分布式和移动协作环境中的并发操作
Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655755
Maher Suleiman, Michèle Cart, J. Ferrié
{"title":"Concurrent operations in a distributed and mobile collaborative environment","authors":"Maher Suleiman, Michèle Cart, J. Ferrié","doi":"10.1109/ICDE.1998.655755","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655755","url":null,"abstract":"In a distributed groupware system, objects shared by users are subject to concurrency and real time constraints. In order to satisfy these, various concurrency control algorithms have been proposed that exploit the semantic properties of operations (C.A. Ellis and S.J. Gibbs, 1989; A. Karsenty and M. Beaudouin-Lafon, 1993; C. Sun et al., 1996). By ordering concurrent operations, they generally guarantee consistency of the different copies of each object. However, in some situations they can result in inconsistent copies, a non respect of user's intentions, and in the need to undo and redo some operations. The principle objective of the paper is to present an algorithm that overcomes these drawbacks in distributed and mobile collaborative environments. The algorithm is based on the notion of user intention, and also on the construction of equivalent histories by exploiting and combining some general semantic properties such as forward/backward transposition.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128853579","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}
引用次数: 132
The new database imperatives 新的数据库需求
Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655759
G. Graefe
{"title":"The new database imperatives","authors":"G. Graefe","doi":"10.1109/ICDE.1998.655759","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655759","url":null,"abstract":"The market for database systems as well as the science of creating database systems is shifting. The purpose of the paper and presentation is to outline some non conventional perspectives and to derive imperatives. Some of these perspectives will be shared by some, and some will be controversial: SQL as a language; SQL for business; SQL for scientific analysis; distributed computing; database storage; and Microsoft SQL Server.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128912983","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
The Active HYpermedia Delivery System (AHYDS) using the PHASME application-oriented DBMS 使用PHASME面向应用的DBMS的主动超媒体交付系统(AHYDS)
Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.656030
F. Andrès, K. Ono
{"title":"The Active HYpermedia Delivery System (AHYDS) using the PHASME application-oriented DBMS","authors":"F. Andrès, K. Ono","doi":"10.1109/ICDE.1998.656030","DOIUrl":"https://doi.org/10.1109/ICDE.1998.656030","url":null,"abstract":"AHYDS is a hypermedia platform being developed at NACSIS based on the PHASME application-oriented DBMS. The AHYDS is a media delivery platform to support various hypermedia applications. The features of customisability and active behavior enable to support different kinds of heterogeneous hypermedia applications. AHYDS has hypermedia access capabilities through both query language-based and non-query language-based interfaces. These capabilities are demonstrated in the context of a hypermedia museum application. The AHYDS system is publicly available on request for educational, research and industrial cooperation purposes.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132962810","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}
引用次数: 10
Mining association rules: anti-skew algorithms 关联规则挖掘:抗倾斜算法
Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655811
Jun-Lin Lin, M. Dunham
{"title":"Mining association rules: anti-skew algorithms","authors":"Jun-Lin Lin, M. Dunham","doi":"10.1109/ICDE.1998.655811","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655811","url":null,"abstract":"Mining association rules among items in a large database has been recognized as one of the most important data mining problems. All proposed approaches for this problem require scanning the entire database at least or almost twice in the worst case. We propose several techniques which overcome the problem of data skew in the basket data. These techniques reduce the maximum number of scans to less than 2, and in most cases find all association rules in about 1 scan. Our algorithms employ prior knowledge collected during the mining process and/or via sampling, to further reduce the number of candidate itemsets and identify false candidate itemsets at an earlier stage.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130898418","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
Building a robust workflow management system with persistent queues and stored procedures 使用持久队列和存储过程构建健壮的工作流管理系统
Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655784
F. Leymann, D. Roller
{"title":"Building a robust workflow management system with persistent queues and stored procedures","authors":"F. Leymann, D. Roller","doi":"10.1109/ICDE.1998.655784","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655784","url":null,"abstract":"Production workflow management systems must be scalable, highly available and reliable. We sketch the architecture of such a system that is built entirely on message-oriented middleware and relational database management technology.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130924310","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}
引用次数: 19
首页 上一页 下一页 尾页
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学术官方微信