{"title":"Efficient execution of operations in a DBMS for multidimensional arrays","authors":"Norbert Widmann, P. Baumann","doi":"10.1109/SSDM.1998.688120","DOIUrl":"https://doi.org/10.1109/SSDM.1998.688120","url":null,"abstract":"In the RasDaMan project a database system for management of multidimensional arrays is being built. It offers a declarative query language extending SQL-92 with operations on arrays of arbitrary base types and a C++ programming interface. Integrating arrays in the query language enables the system to process complex queries on high-volume multidimensional data in the database server close to physical data storage. Storage of arrays is done in tiles of arbitrary size. Operations on arrays are transformed into operations on tiles during query optimization and execution. These operations are then executed on tiles loaded from mass storage. This paper describes the underlying formal model for tile based operations on multidimensional arrays and its efficient implementation in C++ as part of the RasDaMan system.","PeriodicalId":120937,"journal":{"name":"Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125856486","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}
M. Gebhardt, M. Jarke, M. Jeusfeld, C. Quix, Stefan Sklorz
{"title":"Tools for data warehouse quality","authors":"M. Gebhardt, M. Jarke, M. Jeusfeld, C. Quix, Stefan Sklorz","doi":"10.1109/SSDM.1998.688130","DOIUrl":"https://doi.org/10.1109/SSDM.1998.688130","url":null,"abstract":"We show three interrelated tools intended to improve different aspects of the quality of data warehouse solutions. Firstly, the deductive object manager ConceptBase is intended to enrich the semantics of data warehouse solutions by including an explicit enterprise-centered concept of quality. The positive impact of precise multidimensional data models on the client interface is demonstrated by CoDecide, an Internet-based toolkit for the flexible visualization of multiple, interrelated data cubes. Finally, MIDAS is a hybrid data mining system which analyses multi-dimensional data to further enrich the semantics of the meta database, using a combination of neural network techniques, fuzzy logic and machine learning.","PeriodicalId":120937,"journal":{"name":"Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129264461","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}
{"title":"Remote access to Earth science data by content, space, and time","authors":"E. Dobinson, R. Raskin","doi":"10.1109/SSDM.1998.688128","DOIUrl":"https://doi.org/10.1109/SSDM.1998.688128","url":null,"abstract":"For the past several years a small team of developers at the Jet Propulsion Laboratory and at the University of Rhode Island have been working on a system to provide Earth scientists with access to remotely held data sets stored in various standard formats as though the data were local to the user's application. This capability requires not only interoperability among multiple formats and remote access to data via the Internet, but also the ability to identify and select small subsets of data by space, time, and measured parameter. This demo presents the combination of an http-based client/server application that facilitates Internet access to Earth science data coupled with a Java applet GUI that allows the user to graphically select data based on spatial and temporal coverage plots and scientific parameters. Access to data by values of the measured parameters is feasible via the same indexing schemes used for space and time, and work to include this capability is in progress.","PeriodicalId":120937,"journal":{"name":"Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115403709","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}
{"title":"Integrated metadata-systems within statistical offices","authors":"Reinhard Karge","doi":"10.1109/SSDM.1998.688127","DOIUrl":"https://doi.org/10.1109/SSDM.1998.688127","url":null,"abstract":"This paper is based on the experiences of developing the Bridge system as an integrated metadata management system for statistical offices. Investigating metadata systems in different European statistical offices it turned out that metadata is required from within several processes and for quite different purposes. In many cases metadata is purpose related, i.e. metadata is located in different places and quite often in a redundant way. Moreover, problems arise in handling different versions of metadata and providing metadata for different languages. Bridge has been developed as an integrated metadata system (IMS) to overcome such problems as redundancy, different user interfaces and others caused by heterogeneous metadata environments. How an IMS like Bridge is able to integrate distributed metadata systems and the possibilities to solve problems of different versions for metadata as well as multilingual support for document objects is shown in this paper.","PeriodicalId":120937,"journal":{"name":"Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114646926","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}
{"title":"Discrete object detection and motion registration based on a data management approach","authors":"Hans Hinterberger, B. Bauer-Messmer","doi":"10.1109/SSDM.1998.688115","DOIUrl":"https://doi.org/10.1109/SSDM.1998.688115","url":null,"abstract":"When scientific data sets can be interpreted visually they are typically managed as pictures and consequently stored as large collections of bitmaps. Valuable information contained in images is often not exploited, however simply because the data is not processed further. Common reasons for this are that access to information in image collections is notoriously difficult and that interesting applications often depend on supplementary data with incompatible formats. If such data sets are treated as higher-dimensional point data instead of byte streams and managed with a suitable multidimensional file structure, then it is possible to transform \"fuzzy\" objects into n-dimensional solids. Several benefits result: content based access becomes possible, the potential for data compression without loss of relevant information exists and additional information can readily be incorporated simply by increasing the file structure's dimensionality. This paper describes how this approach has been successfully applied to detect and track storm cells in weather radar and various satellite images. The key is to parametrize the data for efficient access based on several different image attributes.","PeriodicalId":120937,"journal":{"name":"Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123522462","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}
{"title":"A scalable bottom-up data mining algorithm for relational databases","authors":"G. Giuffrida, Lee G. Cooper, W. Chu","doi":"10.1109/SSDM.1998.688125","DOIUrl":"https://doi.org/10.1109/SSDM.1998.688125","url":null,"abstract":"Machine learning induction algorithms are difficult to scale to very large databases because of their memory-bound nature. Using virtual memory results in a significant performance degradation. To overcome such shortcomings, we developed a classification rule induction algorithm for relational databases. Our algorithm uses a bottom-up rule generation strategy that is more effective for mining databases having large cardinality of nominal variables. We have successfully used our algorithm to mine a retail grocery database containing more than 1.6 million records in about 5 hours on a dual Pentium processor PC.","PeriodicalId":120937,"journal":{"name":"Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133923234","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}
{"title":"From a procedural to a visual query language for OLAP","authors":"L. Cabibbo, Riccardo Torlone","doi":"10.1109/SSDM.1998.688113","DOIUrl":"https://doi.org/10.1109/SSDM.1998.688113","url":null,"abstract":"We address the issue of designing effective query languages for OLAP databases. The basis of our investigation is MD, a new data model for multidimensional databases that, unlike other multidimensional models, is independent of any specific implementation and as such provides a clear separation between practical and conceptual aspects. In this framework, we present and compare two query languages, based on different paradigms, for OLAP databases. The first language is algebraic and provides an effective way to manipulate multidimensional data in a procedural fashion. Although this language is clean and powerful, it is clearly not suited for final users. We therefore propose a high-level graphical language that allows the user to specify analytical queries in a natural and intuitive way. It turns out that the two languages have the same expressive power.","PeriodicalId":120937,"journal":{"name":"Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123849401","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}
{"title":"Efficient proximity search in multivariate data","authors":"David T. Kao, R. Bergeron, Ted M. Sparr","doi":"10.1109/SSDM.1998.688119","DOIUrl":"https://doi.org/10.1109/SSDM.1998.688119","url":null,"abstract":"Proximity search is an important type of database query which is essential to many practical applications involving various types of metric data, including multivariate data with distance function. Point spatial data is a popular subset of metric data in which each data record corresponds to a point in a multidimensional space, and the proximity is represented as a distance function, such as the Euclidean distance, defined on the multidimensional space. Numerous hierarchical data structures, under the name of point spatial data structures, have been developed for implementing efficient spatial proximity searches. Much less work has been done on developing general hierarchical metric data structures for general metric data, such as non-spatial multivariate data. This paper presents an innovative approach for deriving a new class of hierarchical metric data structures from existing point spatial data structures. Instead of performing direct decomposition on metric data as is done for previous hierarchical data structures such as metric trees and vp-trees, we define a class of simple proximity-preserving mappings from metric data to multidimensional spaces, which we call multipolar mappings. By applying multipolar mappings to metric data, hierarchical decompositions can be done in multidimensional space, and various point spatial data structures, such as quadtree, octree, or k-d tree, can be utilized for storing and accessing metric data based on proximity.","PeriodicalId":120937,"journal":{"name":"Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121508407","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}
{"title":"Moving objects databases: issues and solutions","authors":"O. Wolfson, Bo Xu, S. Chamberlain, Liqin Jiang","doi":"10.1109/SSDM.1998.688116","DOIUrl":"https://doi.org/10.1109/SSDM.1998.688116","url":null,"abstract":"Consider a database that represents information about moving objects and their location. For example, for a database representing the location of taxi-cabs a typical query may be: retrieve the free cabs that are currently within 1 mile of 33 N. Michigan Ave., Chicago (to pickup a customer). In the military, moving object database applications arise in the context of the digital battlefield and in the civilian industry they arise in transportation systems. Currently, moving object database applications are being developed in an ad hoc fashion. Database management system (DBMS) technology provides a potential foundation upon which to develop these applications, however DBMSs are currently not used for this purpose. The reason is that there is a critical set of capabilities that are needed by moving object database applications and are lacking in existing DBMSs. The objective of our Databases fOr MovINg Objects (DOMINO) project is to build an envelope containing these capabilities on top of existing DBMSs. We describe the problems and our proposed solutions.","PeriodicalId":120937,"journal":{"name":"Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132542620","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}
{"title":"Normal forms for multidimensional databases","authors":"Wolfgang Lehner, J. Albrecht, H. Wedekind","doi":"10.1109/SSDM.1998.688112","DOIUrl":"https://doi.org/10.1109/SSDM.1998.688112","url":null,"abstract":"In the area of online analytical processing (OLAP), the concept of multidimensional databases is receiving much popularity. Thus, a couple of different multidimensional data models were proposed from the research as well as from the commercial product side, each emphasizing different perspectives. However, very little work has been done investigating guidelines for good schema design within such a multidimensional data model. Based on a logical reconstruction of multidimensional schema design, this paper proposes two multidimensional normal forms. These normal forms define modeling constraints for summary attributes describing the cells within a multidimensional data cube and constraints to model complex dimensional structures appropriately. Multidimensional schemas compliant to these normal forms do not only ensure the validity of analytical computations on the multidimensional database, but also favor an efficient physical database design.","PeriodicalId":120937,"journal":{"name":"Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127510692","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}