By Topic

Database Engineering and Applications, 2001 International Symposium on.

Date 16-18 July 2001

Filter Results

Displaying Results 1 - 25 of 41
  • Proceedings 2001 International Database Engineering and Applications Symposium

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (248 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2001, Page(s):367 - 368
    Request permission for commercial reuse | PDF file iconPDF (84 KB)
    Freely Available from IEEE
  • Novel algorithms for computing medians and other quantiles of disk-resident data

    Publication Year: 2001, Page(s):145 - 154
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB) | HTML iconHTML

    In data warehousing applications, numerous OLAP queries involve the processing of holistic operations such as computing the “top N”, median, etc. Efficient implementations of these operations are hard to come by. Several algorithms have been proposed in the literature that estimate various quantiles of disk-resident data. Two such recent algorithms are based on sampling. The authors pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cryptography and relational database management systems

    Publication Year: 2001, Page(s):273 - 284
    Cited by:  Papers (7)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB) | HTML iconHTML

    Security is becoming one of the most urgent challenges in database research and industry, and the challenge is intensifying due to the enormous popularity of e-business. The authors study database security from a cryptographic point of view. They show how to integrate modern cryptography technology into a relational database management system to solve some major security problems. Our study shows ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic systems specifications using versions and time

    Publication Year: 2001, Page(s):99 - 107
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB) | HTML iconHTML

    A temporal data model can be used to specify not only static but also dynamic aspects of an application, allowing us to record the evolution of its objects. Conventional applications commonly use the concept of transaction to update information, while unconventional applications require managing many database states to keep the update history. To fulfil this request, the concept of version is pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prefix trees: new efficient data structures for matching strings of different lengths

    Publication Year: 2001, Page(s):76 - 85
    Cited by:  Papers (2)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB) | HTML iconHTML

    Prefix matching is an essential part of some applications. A well known application of prefix matching is layers 3 and 4 switching in TCP/IP protocols. It is assumed that there are strings of an alphabet Σ which are ordered. The strings may have different lengths and some may be prefixes of others. We introduce a simple scheme for comparing and sorting strings of different lengths first. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Similarity-based operators and query optimization for multimedia database systems

    Publication Year: 2001, Page(s):346 - 355
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB) | HTML iconHTML

    The many successful research results in the domain of computer vision have made similarity based data retrieval techniques a promising approach. As a result, the integration of similarity based retrieval techniques of multimedia data into DBMSs is currently an active research issue. We first illustrate the importance of similarity based operations. Then, we present our image data repository model ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Steiner-optimal data replication in tree networks with storage costs

    Publication Year: 2001, Page(s):285 - 293
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB) | HTML iconHTML

    We consider the problem of placing copies of objects at multiple locations in a distributed system, whose interconnection network is a tree, in order to minimize the cost of servicing read and write requests to the objects. We assume that the tree nodes have limited storage and the number of copies permitted may be limited. The set of nodes that have a copy of the object, called replica nodes, con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of bitmap indices for scientific data

    Publication Year: 2001, Page(s):47 - 57
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB) | HTML iconHTML

    Bitmap indices are efficient multi-dimensional index data structures for handling complex adhoc queries in read-mostly environments. They have been implemented in several commercial database systems but are only well suited for discrete attribute values which are very common in typical business applications. However, many scientific applications usually operate on floating point numbers and cannot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reducing inconsistency in integrating data from different sources

    Publication Year: 2001, Page(s):209 - 218
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB) | HTML iconHTML

    One of the main problems in integrating databases into a common repository is the possible inconsistency of the values stored in them, i.e., the very same term may have different values, due to misspelling, a permuted word order, spelling variants and so on. The authors present an automatic method for reducing inconsistency found in existing databases, and thus, improving data quality. All the val... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Version propagation in federated database systems

    Publication Year: 2001, Page(s):189 - 198
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1036 KB) | HTML iconHTML

    Integrated engineering environments, based on federated database technology, are, among others, a means to control the integrity of and dependencies between product data created in many different engineering applications. Most of these applications support the management of versions of a product and its parts, continuing the engineers' tradition of keeping different versions of drawings and docume... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual integration of temporal and conflicting information

    Publication Year: 2001, Page(s):243 - 248
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB) | HTML iconHTML

    The paper presents a way of integrating conflicting temporal information from multiple information providers considering a property-based resolution. The properties considered in the paper are time and uncertainty because of conflicting information providers. The property based resolution requires a flexible query mechanism, where answers are considered as bounds, taking into account the tendency ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for understanding existing databases

    Publication Year: 2001, Page(s):330 - 336
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB) | HTML iconHTML

    The authors propose a framework for a broad class of data mining algorithms for understanding existing databases: functional and approximate dependency inference, minimal key inference, example relation generation and normal form tests. We point out that the common data centric step of these algorithms is the discovery of agree sets. A set-oriented approach for discovering agree sets from database... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic integration of XML heterogeneous data sources

    Publication Year: 2001, Page(s):199 - 208
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB) | HTML iconHTML

    With the current explosion of data, retrieving and integrating information from various sources is a critical problem. The designer has to specify a mediated schema providing a homogeneous view of the sources. We report on an initial work toward automatically generating mappings between elements in the sources and the mediated schema. Information sources we are interested in are XML documents with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of schemaSQL queries

    Publication Year: 2001, Page(s):111 - 116
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB) | HTML iconHTML

    We study the optimization of schemaSQL and schemaSQL-like languages. Our starting point is an extended relational algebra which can be used to implement schemaSQL and similar languages. We study transformation (rewrite) rules for the extended algebra which are used in a prototype cost-based optimizer for the rewriting of expressions into more efficient ones, generating alternative execution plans,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query languages and XML

    Publication Year: 2001, Page(s):297 - 300
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB) | HTML iconHTML

    XML data is different from data found in relational databases in several important respects. The article discusses these differences and why they justify development of a new query language for XML. It also reports on the activities of the W3C working group on XML queries View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing KDB-trees to support high-dimensional data

    Publication Year: 2001, Page(s):58 - 67
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB) | HTML iconHTML

    The problem of retrieving large volumes of high dimensional data is an important and timely issue in the area of database management. The guiding idea of the paper is to develop a general-purpose point access method that attacks the limitations of KDB-trees in high-dimensional spaces, while preserving their relatively good performance in low-dimensional situations. The proposed structure, called h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query scheduling in multi query optimization

    Publication Year: 2001, Page(s):11 - 19
    Cited by:  Papers (4)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB) | HTML iconHTML

    Complex queries are becoming commonplace, with the growing use of decision support systems. Decision support queries often have a lot of common sub-expressions within each query, and queries are often run as a batch. Multi query optimization aims at exploiting common sub-expressions, to reduce the evaluation cost of queries, by computing them once and then caching them for future use, both within ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • XPathLog: a declarative, native XML data manipulation language

    Publication Year: 2001, Page(s):123 - 128
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB) | HTML iconHTML

    XPathLog is a logic-based language for manipulating and integrating XML data. It extends the XPath query language with Prolog-style variables. Due to the close relationship with XPath, the semantics of rules is easy to grasp. In contrast to other approaches, the XPath syntax and semantics is also used for a declarative specification how the database should be updated: when used in rule heads, XPat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive ROLAP on large datasets: a case study with UB-trees

    Publication Year: 2001, Page(s):167 - 176
    Cited by:  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB) | HTML iconHTML

    Online analytical processing (OLAP) requires query response times within the range of a few seconds in order to allow for interactive drilling, slicing, or dicing through an OLAP cube. While small OLAP applications use multidimensional database systems, large OLAP applications like the SAP BW rely on relational (ROLAP) databases for efficient data storage and retrieval. ROLAP databases use special... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evolution of database technology: hyperdatabases

    Publication Year: 2001, Page(s):139 - 141
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB) | HTML iconHTML

    Our vision is that hyperdatabases become available that extend and evolve from database technology. Hyperdatabases move up to a higher level, closer to the applications. A hyperdatabase manages distributed objects and software components as well as workflows, in analogy to a database system that manages data and transactions. In short, hyperdatabases will provide “higher order data independe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An adaptive and efficient clustering-based approach for content-based image retrieval in image databases

    Publication Year: 2001, Page(s):356 - 365
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB) | HTML iconHTML

    The authors present a novel content based image retrieval (CBIR) approach, for image databases, based on cluster analysis. CBIR relies on the representation (metadata) of images' visual content. In order to produce such metadata, we propose an efficient and adaptive clustering algorithm to segment the images into regions of high similarity. This approach contrasts with those that use a single colo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study on content-based classification and retrieval of audio database

    Publication Year: 2001, Page(s):339 - 345
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB) | HTML iconHTML

    Nowadays, available audio corpora are rapidly increasing from fast growing Internet and digitized libraries. How to effectively classify and retrieve such huge databases is a challenging task. Content based technology is studied to automatically classify audio into hierarchy classes. Based on a small set of features selected by the sequential forward selection (SFS) method from 87 extracted ones, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of external schemas in ODMG databases

    Publication Year: 2001, Page(s):89 - 98
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB) | HTML iconHTML

    A method for generating external schemas in object oriented databases in the ODMG framework is proposed. External schema generation involves obtaining all the relationships existing between the classes selected to make up an external schema. This generation process is part of an external schema definition system that we are developing, which allows the definition of external schemas in ODMG. Exter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tradeoff between client and server transaction validation in mobile environment

    Publication Year: 2001, Page(s):265 - 272
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB) | HTML iconHTML

    With the rapid proliferation of mobile devices and services, efficient support for mobile transactions has become extremely important. As locking based pessimistic approaches to concurrency control have been known to be not very suitable for the mobile environment, many optimistic concurrency control schemes have been proposed to date, of which the broadcast certification based approach is of spec... View full abstract»

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