By Topic

Scientific and Statistical Database Management, 2000. Proceedings. 12th International Conference on

Date 28-28 July 2000

Filter Results

Displaying Results 1 - 25 of 25
  • Proceedings. 12th International Conference on Scientific and Statistica Database Management

    Publication Year: 2000
    Save to Project icon | Request Permissions | PDF file iconPDF (241 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 2000 , Page(s): 263
    Save to Project icon | Request Permissions | PDF file iconPDF (66 KB)  
    Freely Available from IEEE
  • Knowledge-based integration of neuroscience data sources

    Publication Year: 2000 , Page(s): 39 - 52
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1316 KB)  

    The need for information integration is paramount in many biological disciplines, because of the large heterogeneity in both the types of data involved and in the diversity of approaches (physiological, anatomical, biochemical, etc.) taken by biologists to study the same or correlated phenomena. However, the very heterogeneity makes the task of information integration very difficult since two appr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coordinating simultaneous caching of file bundles from tertiary storage

    Publication Year: 2000 , Page(s): 196 - 206
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (180 KB)  

    In a previous paper, we described a system called STAGS (Storage Access Coordination System) for High Energy and Physics (HEP) experiments. These experiments generate very large volumes of “event” data at a very high rate. The volumes of data may reach 100's of terabytes/year and therefore they are stored on robotic tape systems that are managed by a mass storage system. The data are s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic aggregation using explicit metadata

    Publication Year: 2000 , Page(s): 85 - 94
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (256 KB)  

    The paper presents a logical data model for statistical data with an explicit modeling of metadata, which allows to perform automatic aggregation. The data are stored in standard relations from the relational model, while the metadata, defining the semantics of the relations, are represented by numerical dependencies which specify the way the summary values are defined in terms of micro-data, as w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending GeoToolKit to access distributed spatial data and operations

    Publication Year: 2000 , Page(s): 259 - 261
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (244 KB)  

    The integration of extremely heterogeneous geo-scientific data is a challenging problem. To provide a non-redundant maintenance and cooperative utilisation of data by different applications developed within the interdisciplinary geo-scientific research centre at the University of Bonn we elaborated a technology based on GeoToolKit-a component-based software development tool. In the paper we presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Techniques for effective integration, maintenance and evolution of species databases

    Publication Year: 2000 , Page(s): 3 - 13
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (292 KB)  

    The LITCHI project is concerned with the integration and maintenance of databases of biological knowledge organised by species. We use constraints pertaining to good taxonomic practice in order to identify taxonomix conflicts in individual species databases and in databases formed by merging species databases from distinct sources. The LITCHI system can be used to resolve such conflicts incrementa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TSA-tree: a wavelet-based approach to improve the efficiency of multi-level surprise and trend queries on time-series data

    Publication Year: 2000 , Page(s): 55 - 68
    Cited by:  Papers (6)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (516 KB)  

    We introduce a novel wavelet based tree structure, termed TSA-tree, which improves the efficiency of multi-level trend and surprise queries on time sequence data. With the explosion of scientific observation data conceptualized as time sequences, we are facing the challenge of efficiently storing, retrieving and analyzing this data. Frequent queries on this data set are to find trends (e.g., globa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing geospatial operations in an object-relational database system

    Publication Year: 2000 , Page(s): 209 - 219
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (376 KB)  

    Over the last decade the need to implement functions into a DBMS that are application-specific has increased. For this reason today most object-relational DBMS (ORDBMS) provide features that allow the user to include application-specific functions into the DBMS for their execution within database queries. This paper reports on an implementation effort to include spatial operations into an ORDBMS a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • pCube: Update-efficient online aggregation with progressive feedback and error bounds

    Publication Year: 2000 , Page(s): 95 - 108
    Cited by:  Papers (1)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (460 KB)  

    Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries as well as updates to the data cube becomes difficult. Another problem that arises with increased dimensionality is the sparseness of the data space. In this paper we develop a new data structure referred to as the pCube ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient web access to distributed biological collections using a taxonomy browser

    Publication Year: 2000 , Page(s): 25 - 38
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (352 KB)  

    We propose to use an explicit taxonomy as a key element in a system that integrates distributed, heterogeneous biological databases. The system features a Web interface that enables a user to navigate a taxonomy tree and to post queries to distributed biological collections databases based on a selected node in the taxonomy tree. We use the taxonomy dataset published by the National Centre for Bio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Light-weight indexing of general bitemporal data

    Publication Year: 2000 , Page(s): 125 - 138
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (384 KB)  

    Most data managed by existing, real-world database applications is time referenced. Often, two temporal aspects of data are of interest, namely valid time, when data is true in the mini-world, and transaction time, when data is current in the database, resulting in so-called bitemporal data. Like spatial data, bitemporal data thus has associated two-dimensional regions. Such data is in part natura... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Serving datacube tuples from main memory

    Publication Year: 2000 , Page(s): 182 - 195
    Cited by:  Patents (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (356 KB)  

    Existing datacube precomputation schemes materialize selected datacube tuples on disk, choosing the most beneficial cuboids (i.e., combinations of dimensions) to materialize given a space limit. However in the context of a data-warehouse receiving frequent “append” updates to the database, the cost of keeping these disk-resident cuboids up-to-date can be high. In this paper we propose ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating network-based moving objects

    Publication Year: 2000 , Page(s): 253 - 255
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (224 KB)  

    Benchmarking spatiotemporal database systems requires the generation of suitable datasets simulating the typical behavior of moving objects. Previous approaches do not consider that in many applications the moving objects follow a given network. In this paper, the most important properties of network-based moving objects are presented. These properties are the basis for specifying and developing a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Prometheus database for taxonomy

    Publication Year: 2000 , Page(s): 250 - 252
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (188 KB)  

    This paper presents the work carried out in the Prometheus project and its motivation, taxonomy. Taxonomy presents challenges to common database systems. Because of its complexity and the necessary treatments applied to its data, common database model such as the relational, the object-oriented of even graph models are not able to support taxonomic applications fully. Our approach is the extension... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance evaluation of log-only temporal object database systems

    Publication Year: 2000 , Page(s): 256 - 258
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (136 KB)  

    An alternative to in-place updating of data is to eliminate the database completely, and use a log-only approach. The log is written contiguously to the disk, in a no-overwrite way, in large blocks. The log-only approach is particularly interesting for transaction time object database systems (TODB), because keeping previous versions of objects is a feature that comes for free. One of the objectio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A tool for nesting and clustering large objects

    Publication Year: 2000 , Page(s): 169 - 181
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2296 KB)  

    In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probability of a large object, query performance depends on its representation: either inlined within the aggregate or swapped out to a separate object. Furthermore, the implementation of complex data models often requires nested la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Three improvements to the BLASTP search of genome databases

    Publication Year: 2000 , Page(s): 14 - 24
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (292 KB)  

    The BLASTP program is a search tool for databases of protein sequences that is widely used by biologists as a first step in investigating new genome sequences. BLASTP finds high-scoring local alignments (qiqi+1…qi+k||s jsj+1…sj+k) without gaps between a query sequence q and sequences s in the database. The score of an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending geographic databases for a query language to support queries involving statistical data

    Publication Year: 2000 , Page(s): 220 - 230
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (264 KB)  

    The concepts abstracted from reality and represented through the dimensions in a Statistical Database (SDB) support the user to use them in query formulation and processing. Instead, all those useful properties involved in a query that cannot be obtained through dimension/s in aN SDB (for example, the concept of adjacency) can be presented in a Geographical Database (GDB). This paper presents a co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting content-based searches on time series via approximation

    Publication Year: 2000 , Page(s): 69 - 81
    Cited by:  Papers (14)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (472 KB)  

    Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series whose contents are similar to what users specify. The content types studied include shapes, trends, cyclic components, autocorrelation functions and partial autocorrelation functions. Due to the complex nature of the simi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Answering multidimensional queries on cubes using other cubes

    Publication Year: 2000 , Page(s): 109 - 122
    Cited by:  Papers (1)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (408 KB)  

    Recently there is an important interest in On-Line Analytical Processing (OLAP) technology. In this context, in order to facilitate complex analysis, data are usually modeled multidimensionally where multiple hierarchies are associated with the dimensions. These multidimensional (MD) data structures are called data cubes. In the existing OLAP products, the user interaction is limited to one operat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An integrated database system at the national level for water resource engineers and planners of Bangladesh

    Publication Year: 2000 , Page(s): 247 - 249
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (128 KB)  

    This paper discusses practical issues of developing and implementing an integrated database system that contains water resources data having both space and time varying characteristics. This database has been the National Databank for all the data sets relating water resources planning. The logical inter-dependencies between temporal and spatial data sets have been modelled exploiting RDBMS techni... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward spatial joins for polygons

    Publication Year: 2000 , Page(s): 231 - 244
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (408 KB)  

    Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (MBR) of the spatial objects (MBR-filter) and evaluate the actual join of the objects using the results of the join on approximations. Improvements to add additional filtering using more accurate approximations were a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The sort/sweep algorithm: a new method for R-tree based spatial joins

    Publication Year: 2000 , Page(s): 153 - 165
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (388 KB)  

    We propose a new algorithm to solve the problem of joining two spatial relations R and S when S is indexed by an R-tree. The method combines classical query processing techniques and a plane-sweeping algorithm. We compare our approach to the simple indexed-nested-loop method and to the state-of-the-art algorithms, and show through analysis and experiments on synthetic and real-life datasets that o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing selections over datacubes

    Publication Year: 2000 , Page(s): 139 - 152
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (356 KB)  

    Datacube queries compute aggregates over database relations at a variety of granularities. Often one wants only datacube output tuples whose aggregate value satisfies a certain condition, such as exceeding a given threshold. We develop algorithms for processing a datacube query using the selection condition internally during the computation. Thus, we can safely prune parts of the computation and e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.