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

A transparent replication of HTTP service HTTP服务的透明复制

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

Radek Vingralek, Y. Breitbart, Mehmet Sayal, P. Scheuermann

引用次数: 2

Algorithms for index-assisted selectivity estimation 索引辅助选择性估计算法

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

Paul M. Aoki

引用次数: 6

TP-monitor-based workflow management system architecture 基于tp监视器的工作流管理系统架构

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

C. Bussler

引用次数: 0

Heterogeneous query processing through SQL table functions 通过SQL表函数处理异构查询

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

B. Reinwald, H. Pirahesh, Ganapathy Krishnamoorthy, G. Lapis, Brian T. Tran, Swati Vora

{"title":"Heterogeneous query processing through SQL table functions","authors":"B. Reinwald, H. Pirahesh, Ganapathy Krishnamoorthy, G. Lapis, Brian T. Tran, Swati Vora","doi":"10.1109/ICDE.1999.754952","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754952","url":null,"abstract":"In today's IT infrastructures, data is stored in SQL databases, non-SQL, databases, and host databases like ISAM/VSAM files. Non-SQL databases are specialized data stores controlled by applications like spreadsheets, mail, directory and index services. Developing applications accessing a variety of different data sources is challenging for application developers due to different environments, APIs, bindings, etc. 20 years ago, SQL was created to ease the life of database application developers and provide a uniform way for accessing data which is stored in SQL databases. The paper describes an implementation of table functions and its usage for accessing data stored outside SQL databases in diverse external data stores. Table functions are compliant with the relational data model, and therefore fit into the well established SQL language. The table-function architecture is open, and allows the deployment of generic data access infrastructures such as Microsoft's OLE DB or Java's JDBC (G. Hamilton et al., 1997). The paper describes a prototype implementation of OLE DB table functions with advanced query optimization techniques. The prototype is based on IBM DB2 UDB relational database system.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"72 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":"131530443","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}

引用次数: 34

Developing a DataBlade for a new index 为新索引开发数据库

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

R. Bliujute, Simonas Šaltenis, Giedrius Slivinskas, Christian S. Jensen

引用次数: 50

Raster-spatial data declustering revisited: an interactive navigation perspective 栅格空间数据聚类重访:交互式导航视角

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

Chung-Min Chen, R. Sinha

引用次数: 6

Ad hoc OLAP: expression and evaluation 特设OLAP:表达式和求值

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

Damianos Chatziantoniou

{"title":"Ad hoc OLAP: expression and evaluation","authors":"Damianos Chatziantoniou","doi":"10.1109/ICDE.1999.754930","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754930","url":null,"abstract":"Users frequently formulate complex data analysis queries in order to identify interesting trends, make unusual patterns stand out, or verify hypotheses. Being able to express these data mining queries concisely is of major importance not only from the user's, but also from the system's point of view. Recent research in OLAP has focused on datacubes and their applications; however expression and processing of ad hoc decision support queries has been given very little attention. We present an appropriate framework for these queries and introduce a syntactic construct to support it. This SQL extension allows most OLAP queries, such as pivoting, complex intra- and inter-group comparisons, trends and hierarchical comparisons, to be expressed in a compact, intuitive and simple manner. This succinct representation of a complex OLAP query translates immediately to a novel, simple and efficient evaluation algorithm. We show how to optimize, analyze and parallelize this algorithm and discuss issues such as multiple query analysis and scaling. We present several experimental results of real life queries that show orders of magnitude of performance improvement. We argue that this tight coupling between representation and algorithm is essential to efficient processing of ad hoc OLAP queries.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"44 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":"121586853","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

Indexing constraint databases by using a dual representation 使用双重表示对约束数据库进行索引

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

E. Bertino, B. Catania, Boris Chidlovskii

{"title":"Indexing constraint databases by using a dual representation","authors":"E. Bertino, B. Catania, Boris Chidlovskii","doi":"10.1109/ICDE.1999.754978","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754978","url":null,"abstract":"Linear constraint databases are a powerful framework to model spatial and temporal data. The use of constraint databases should be supported by access data structures that make effective use of secondary storage and reduce query processing time. Such structures should be able to store both finite and infinite objects and perform both containment (ALL) and intersection (EXIST) queries. As standard indexing techniques have certain limitations in satisfying such requirements, we employ the concept of geometric duality for designing new indexing techniques. In (Bertino et al., 1997) we have used the dual transformation for polyhedra to develop a dynamic optimal indexing solution based on B/sup +/-trees, to detect all objects contained in or intersecting a given half-plane, when the angular coefficient belongs to a predefined set. We extend the previous solution to allow angular coefficients to take any value. We present two approximation techniques for the dual representation of spatial objects, based on B/sup +/-trees. The techniques handle both finite and infinite objects and process both ALL and EXIST selections in a uniform way. We show the practical applicability of the proposed techniques by an experimental comparison with respect to R/sup +/-trees.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"24 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":"124437696","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

Scheduling and data replication to improve tape jukebox performance 调度和数据复制，以提高磁带点唱机的性能

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

B. Hillyer, R. Rastogi, A. Silberschatz

引用次数: 15

Estimating the usefulness of search engines 估计搜索引擎的有用性

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

W. Meng, King-Lup Liu, Clement T. Yu, Wensheng Wu, N. Rishe

引用次数: 61