Proceedings 14th International Conference on Data Engineering最新文献_第5页

Outstanding challenges in OLAP OLAP面临的突出挑战

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655774

J. Bedell

引用次数: 11

Processing incremental multidimensional range queries in a direct manipulation visual query environment 在直接操作可视化查询环境中处理增量多维范围查询

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655808

S. Hibino, Elke A. Rundensteiner

引用次数: 16

The effect of buffering on the performance of R-trees 缓冲对r树性能的影响

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655772

Scott T. Leutenegger, M. Lopez

引用次数: 94

Query processing in a video retrieval system 视频检索系统中的查询处理

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655787

King-Lup Liu, A. Sistla, Clement T. Yu, N. Rishe

引用次数: 10

Query folding with inclusion dependencies 包含依赖项的查询折叠

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655768

Jarek Gryz

引用次数: 74

Cost models for join queries in spatial databases 空间数据库中连接查询的成本模型

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655810

Y. Theodoridis, E. Stefanakis, T. Sellis

引用次数: 76

Cyclic association rules 循环关联规则

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655804

Banu Özden, S. Ramaswamy, A. Silberschatz

{"title":"Cyclic association rules","authors":"Banu Özden, S. Ramaswamy, A. Silberschatz","doi":"10.1109/ICDE.1998.655804","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655804","url":null,"abstract":"We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may observe seasonal variation where certain rules are true at approximately the same month each year. Similarly, association rules can also display regular hourly, daily, weekly, etc., variation that is cyclical in nature. We demonstrate that existing methods cannot be naively extended to solve this problem of cyclic association rules. We then present two new algorithms for discovering such rules. The first one, which we call the sequential algorithm, treats association rules and cycles more or less independently. By studying the interaction between association rules and time, we devise a new technique called cycle pruning, which reduces the amount of time needed to find cyclic association rules. The second algorithm, which we call the interleaved algorithm, uses cycle pruning and other optimization techniques for discovering cyclic association rules. We demonstrate the effectiveness of the interleaved algorithm through a series of experiments. These experiments show that the interleaved algorithm can yield significant performance benefits when compared to the sequential algorithm. Performance improvements range from 5% to several hundred percent.","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":"123397472","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}

引用次数: 493

Data-intensive intra- and Internet applications-experiences using Java and CORBA in the World Wide Web 数据密集型内部和Internet应用程序-在万维网中使用Java和CORBA的经验

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655792

Jürgen Sellentin, B. Mitschang

{"title":"Data-intensive intra- and Internet applications-experiences using Java and CORBA in the World Wide Web","authors":"Jürgen Sellentin, B. Mitschang","doi":"10.1109/ICDE.1998.655792","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655792","url":null,"abstract":"Intra/Internet technology has become a key issue in the development of modern systems. Nowadays, it is no longer sufficient to present static information sheets through the World Wide Web (WWW). Instead, we need interactive applications that may even compute complex results or process large data sets. In this paper, we describe a prototype based on Java and CORBA. Both represent modern concepts that have been developed to fulfill these requirements. Their combination results into the kind of data processing we want to apply to the WWW: (1) portable, powerful, structured and even reusable client programs instead of cryptic HTML scripts; (2) well-defined interfaces, and (3) efficient server processes separated from the WWW server and its CGI extensions. Communication is controlled by a fault-tolerant CORBA layer, which also enables server development using a different language than Java. Besides a discussion of CORBA and its data shipping capabilities, we take a closer look at Java and its runtime behavior, and we report on the experiences gathered with our prototype system and its testbed application. This system has also been used to gather experiences with and to influence the new language binding of the Standard Data Access Interface (SDAI) of the Standard for the Exchange of Product Data (STEP, ISO 10303) to Java.","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":"128720865","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}

引用次数: 21

Distributed video presentations 分布式视频演示

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655786

Eenjun Hwang, V. S. Subrahmanian, B. Prabhakaran

{"title":"Distributed video presentations","authors":"Eenjun Hwang, V. S. Subrahmanian, B. Prabhakaran","doi":"10.1109/ICDE.1998.655786","DOIUrl":"https://doi.org/10.1109/ICDE.1998.655786","url":null,"abstract":"Considers a distributed video server environment where video movies need not be stored entirely in one server. Blocks of a video movie are be distributed and replicated over multiple video servers. Customers are served by one video server. This video server, termed the originating server, might have to interact with other servers for downloading missing blocks of the requested movie. We present three types of presentation plans that an originating server can possibly construct for satisfying a customer's request. A presentation plan can be considered as a detailed (temporally synchronized) sequence of steps carried out by the originating server for presenting the requested movie to the customer. The creation of presentation plans involves obtaining commitments from other video servers and the network service provider, as well as making local resource commitments, within the limitations of available bandwidth, available buffer and customer consumption rates. For evaluating the goodness of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing the waiting time for a customer and minimizing the access bandwidth. We present algorithms for computing optimal presentation plans and compare their performance experimentally. We have also mathematically proved certain results for the presentation plans.","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":"117352691","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}

引用次数: 7

Mining for strong negative associations in a large database of customer transactions 在大型客户交易数据库中挖掘强烈的负面关联

Proceedings 14th International Conference on Data Engineering Pub Date : 1998-02-23 DOI: 10.1109/ICDE.1998.655812

Ashok Savasere, E. Omiecinski, S. Navathe

引用次数: 335