Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)最新文献

A database approach for modeling and querying video data 一种视频数据建模和查询的数据库方法

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) Pub Date : 1999-08-20 DOI: 10.1109/ICDE.1999.754892

C. Decleir, Mohand-Said Hacid, J. Kouloumdjian

引用次数: 114

Index merging 索引合并

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) Pub Date : 1999-04-01 DOI: 10.1109/ICDE.1999.754945

S. Chaudhuri, Vivek R. Narasayya

引用次数: 66

Multiple index structures for efficient retrieval of 2D objects 多个索引结构，有效地检索二维对象

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) Pub Date : 1999-03-23 DOI: 10.1109/ICDE.1999.754939

C. Shahabi, Maytham Safar, Hezhi Ai

{"title":"Multiple index structures for efficient retrieval of 2D objects","authors":"C. Shahabi, Maytham Safar, Hezhi Ai","doi":"10.1109/ICDE.1999.754939","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754939","url":null,"abstract":"Many applications require the storage and management of large databases of 2D objects. One of the important functionalities required by all of these applications is the capability to find objects in a database that match a given object. We concentrate on whole matching queries, in which a query object is compared with a set of objects to find the ones that are either exactly identical or similar to the query object. There are two obstacles for efficient execution of whole-match queries. First, the general problem of comparing two 2D objects under rotation, scaling and translation invariance is known to be computationally expensive. Second, the size of the databases are growing, and hence a query should be answered without accessing all the objects in the database. To address both obstacles, we identify a set of six features that could be extracted from the objects' minimum bounding circle (MBC). These are: the radius of the MBC, the coordinates of the center of MBC, the set of touch-points on the MBC, the touch-points angle sequence, the vertex angle sequence and the start-point of the angle sequence. The features are unique per object and can be utilized for both efficiently indexing the objects and expediting the comparison between two objects. We focus on three variations of match queries: an exact shape match, an exact match with rotation, scaling or translation, and similarity shape retrieval.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"393 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117091632","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}

引用次数: 4

Fast approximate query answering using precomputed statistics 快速近似查询回答使用预先计算的统计

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) Pub Date : 1999-03-23 DOI: 10.1109/ICDE.1999.754932

V. Poosala, Venkatesh Ganti

引用次数: 39

Parallel algorithms for computing temporal aggregates 计算时间聚合的并行算法

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) Pub Date : 1999-03-23 DOI: 10.1109/ICDE.1999.754958

Jose Alvin G. Gendrano, Bruce C. Huang, Jim M. Rodrigue, Bongki Moon, R. Snodgrass

{"title":"Parallel algorithms for computing temporal aggregates","authors":"Jose Alvin G. Gendrano, Bruce C. Huang, Jim M. Rodrigue, Bongki Moon, R. Snodgrass","doi":"10.1109/ICDE.1999.754958","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754958","url":null,"abstract":"The ability to model the temporal dimension is essential to many applications. Furthermore, the rate of increase in database size and response time requirements has out-paced advancements in processor and mass storage technology, leading to the need for parallel temporal database management systems. In this paper, we introduce a variety of parallel temporal aggregation algorithms for a shared-nothing architecture based on the sequential \"aggregation tree algorithm\". Via an empirical study, we found that the number of processing nodes, the partitioning of the data, the placement of results and the degree of data reduction effected by the aggregation impacted on the performance of the algorithms. For distributed results placement, we discovered that time-division merging was the obvious choice. For centralized results and high data reduction, pairwise merging was preferred, regardless of the number of processing nodes, but for low data reduction, it only performed well up to 32 nodes. This led us to a centralized variant of time-division merging which was best for larger configurations having low data reduction.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130043621","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}

引用次数: 33

Data warehouses evolution: trade-offs between quality and cost of query rewritings 数据仓库演变:查询重写的质量和成本之间的权衡

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) Pub Date : 1999-03-23 DOI: 10.1109/ICDE.1999.754935

Amy J. Lee, A. Koeller, A. Nica, Elke A. Rundensteiner

引用次数: 24

Integrating light-weight workflow management systems within existing business environments 在现有业务环境中集成轻量级工作流管理系统

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) Pub Date : 1999-03-23 DOI: 10.1109/ICDE.1999.754944

Peter Muth, Jeanine Weißenfels, M. Gillmann, G. Weikum

{"title":"Integrating light-weight workflow management systems within existing business environments","authors":"Peter Muth, Jeanine Weißenfels, M. Gillmann, G. Weikum","doi":"10.1109/ICDE.1999.754944","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754944","url":null,"abstract":"Workflow management systems (WfMSs) support the efficient, largely automated execution of business processes. However, using a WfMS typically requires implementing the application's control flow exclusively by the WfMS. This approach is powerful if the control flow is specified and implemented from scratch, but it has severe drawbacks if a WfMS is to be integrated within environments with existing solutions for implementing control flow. Usually, the existing solutions are too complex to be substituted by the WfMS all at once. Hence, the WfMS must support an incremental integration, i.e. the reuse of existing implementations of control flow as well as their incremental substitution. Extending the WfMS's functionality according to future application needs, e.g. by worklist and history management, must also be possible. In particular, at the beginning of an incremental integration process, only a limited amount of a WfMS's functionality is actually exploited by the workflow application. Later on, as the integration proceeds, more advanced requirements arise and demand the customization of the WfMS to the evolving application needs. In this paper, we present the architecture and implementation of a light-weight WfMS, coined Mentor-lite, which aims to overcome the above-mentioned shortcomings of conventional WfMSs. Mentor-lite supports an easy integration of workflow functionality into an existing environment, and can be tailored to specific workflow application needs.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"08 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130933097","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

Multiversion reconciliation for mobile databases 移动数据库的多版本协调

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) Pub Date : 1999-03-23 DOI: 10.1109/ICDE.1999.754974

S. Phatak, B. R. Badrinath

引用次数: 46

STING+: an approach to active spatial data mining STING+:一种主动空间数据挖掘方法

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) Pub Date : 1999-03-23 DOI: 10.1109/ICDE.1999.754914

Wei Wang, Jiong Yang, R. Muntz

{"title":"STING+: an approach to active spatial data mining","authors":"Wei Wang, Jiong Yang, R. Muntz","doi":"10.1109/ICDE.1999.754914","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754914","url":null,"abstract":"Spatial data mining presents new challenges due to the large size of spatial data, the complexity of spatial data types, and the special nature of spatial access methods. Most research in this area has focused on efficient query processing of static data. This paper introduces an active spatial data mining approach which extends the current spatial data mining algorithms to efficiently support user-defined triggers on dynamically evolving spatial data. To exploit the locality of the effect of an update and the nature of spatial data, we employ a hierarchical structure with associated statistical information at the various levels of the hierarchy and decompose the user-defined trigger into a set of sub-triggers associated with cells in the hierarchy. Updates are suspended in the hierarchy until their cumulative effect might cause the trigger to fire. It is shown that this approach achieves three orders of magnitude improvement over the naive approach that re-evaluates the condition over the database for each update, while both approaches produce the same result without any delay. Moreover this scheme can support incremental query processing as well.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132748491","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}

引用次数: 71

Complements for data warehouses 数据仓库的补充

Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337) Pub Date : 1999-03-23 DOI: 10.1109/ICDE.1999.754965

D. Laurent, Jens Lechtenbörger, N. Spyratos, G. Vossen

引用次数: 16