By Topic

Proceedings 2001 International Database Engineering and Applications Symposium

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
  • 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 (1032 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.
  • Author index

    Publication Year: 2001, Page(s):367 - 368
    Request permission for commercial reuse | PDF file iconPDF (84 KB)
    Freely Available from IEEE
  • A study on content-based classification and retrieval of audio database

    Publication Year: 2001, Page(s):339 - 345
    Cited by:  Papers (4)
    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.
  • 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.
  • Metadata management for data warehousing: between vision and reality

    Publication Year: 2001, Page(s):129 - 135
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB) | HTML iconHTML

    Capturing, representing and processing metadata promises to facilitate the management, consistent use and understanding of data and thus better support the exploitation of masses of information that is available online today. Despite the increasing interest in metadata management, its purpose, requirements and problems are still not clear. This is particularly true in the area of data warehousing.... 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.
  • Mining free itemsets under constraints

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

    Computing frequent itemsets and their frequencies from large Boolean matrices (e.g., to derive association rules) has been one of the hot topics in data mining. Levelwise algorithms (e.g., the a priori algorithm) have been proved effective for frequent itemset mining from sparse data. However, in many practical applications, the computation turns out to be intractable for the user-given frequency ... 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 (3)  |  Patents (1)
    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.
  • Exploitation of pre-sortedness for sorting in query processing: the TempTris-algorithm for UB-trees

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

    Bulk loading is used to efficiently build a table or access structure if a large data set is available at index time, e.g., the spool process of a data warehouse or the creation of intermediate results during query processing. The authors introduce the TempTris algorithm that creates a multidimensional partitioning from a one-dimensionally sorted stream of tuples. In order to achieve that, TempTri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experimental evaluation of a new distributed partitioning technique for data warehouses

    Publication Year: 2001, Page(s):312 - 321
    Cited by:  Papers (3)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB) | HTML iconHTML

    Since data warehousing has become a major field of research there has been a lot of interest in reducing the response time of complex queries posed over the very large databases. The problem is that data warehouses store large amounts of data for decision support, requiring a high level of query performance and scalability to the database engines. A novel round-robin data partitioning approach esp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Static analysis of queries as a tool for static optimization

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

    The paper discusses a special phase, called static analysis, which we use for static query optimization. Static analysis, as a compile-time simulation of run-time query evaluation, enables us to gather all the information that we need to optimize a query. We present in detail all the major data structures used by static analysis and discuss how they emulate their run-time equivalents. The paper in... 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.
  • 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.
  • Towards an architecture for real-time decision support systems: challenges and solutions

    Publication Year: 2001, Page(s):303 - 311
    Cited by:  Papers (8)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (956 KB) | HTML iconHTML

    In large enterprises, huge volumes of data are generated and consumed, and substantial fractions of the data change rapidly. Business managers need up-to-date information to make timely and sound business decisions. Unfortunately, conventional decision support systems do not provide the low latencies needed for decision making in this rapidly changing environment. The paper introduces the notion o... 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.
  • A UML-based metamodeling architecture for database design

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

    We use metamodeling for object oriented database design and management. First, in the context of the UML based metamodeling, we provide an overview of what is achievable, e.g., more exhaustive descriptions of classes (their behaviors and their dependencies), validation of external schemas of a database, as well as determination of requirements for software tools to enhance system security. Second,... 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 (9)  |  Patents (8)
    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.
  • 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.
  • Implementing KDB-trees to support high-dimensional data

    Publication Year: 2001, Page(s):58 - 67
    Cited by:  Papers (11)
    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.
  • 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.
  • Integrity constraint management for design object versions in a concurrent engineering design environment

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

    Concurrent engineering (CE) is a product development approach which requires a collaborative multidisciplinary team environment with effective communication. Due to the evolutionary nature of the engineering design process, it is necessary to provide support for version management. The version model should be provided with an integrity checking mechanism to assure the consistency of object version... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting upper and lower bounds in top-down query optimization

    Publication Year: 2001, Page(s):20 - 33
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB) | HTML iconHTML

    System R's bottom-up query optimizer architecture forms the basis of most current commercial database managers. The paper compares the performance of top-down and bottom-up optimizers, using the measure of the number of plans generated during optimization. Top down optimizers are superior according to this measure because they can use upper and lower bounds to avoid generating groups of plans. Ear... 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 (7)
    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.
  • 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.