By Topic

Database Engineering and Applications, 1999. IDEAS '99. International Symposium Proceedings

4-4 Aug. 1999

Filter Results

Displaying Results 1 - 25 of 56
  • Proceedings. IDEAS'99. International Database Engineering and Applications Symposium (Cat. No.PR00265)

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

    Publication Year: 1999, Page(s):466 - 467
    Request permission for commercial reuse | PDF file iconPDF (8 KB)
    Freely Available from IEEE
  • Query result size estimation using a novel histogram-like technique: the rectangular attribute cardinality map

    Publication Year: 1999, Page(s):3 - 15
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    Current database systems utilize histograms to approximate frequency distributions of attribute values of relations. These are used to efficiently estimate query result sizes and access plan costs. Even though they have been in use for nearly two decades, there has been no significant mathematical techniques (other than those used in statistics for traditional histogram approximations) to study th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lexicographically ordered functional dependencies and their application to temporal relations

    Publication Year: 1999, Page(s):279 - 287
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    Proposes an ordered relational model and defines lexicographically ordered functional dependencies (LOFDs) according to the lexicographical ordering on the Cartesian product of those domains associated with the involved attributes. An LOFD in the ordered relational model captures the semantics of a monotonicity property between two sets of data. We establish a set of sound and complete chase rules... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental maintenance of nested relational views

    Publication Year: 1999, Page(s):197 - 205
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    Incremental view maintenance techniques are required for many new types of data models that are being increasingly used in industry. One of these models is the nested relational model that is used in the modelling of complex objects in databases. In this paper, we derive a group of expressions for incrementally evaluating query expressions in the nested relational model. We also present an algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring the performance of database object horizontal fragmentation schemes

    Publication Year: 1999, Page(s):408 - 414
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    A horizontal fragment of a database class in an object-oriented database system contains subsets of its instance objects (or class extents) reflecting the way applications are accessing database objects. Allocating well-defined fragments of classes to distributed sites has the advantage of minimizing transmission costs of data to remote sites as well as minimizing retrieval time of data needed loc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Between well-founded semantics and stable model semantics

    Publication Year: 1999, Page(s):270 - 278
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    Using fixpoint operations, we define a new semantics for Datalog programs with negation. The semantics is deterministic. Given a program Δ, the model of Δ in the new semantics includes the well-founded model, and is included in all stable models, if such models exist. In particular, there exist programs that have no stable models, or their well-founded model is empty, but their model i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for deferred view maintenance

    Publication Year: 1999, Page(s):188 - 196
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    Presents a model for deferred maintenance of object-oriented views. Queries that define views are implemented as methods that are invoked to compute the corresponding views. A deferred update reflects to a view only those related modifications that were introduced into the database while that view was inactive. A view is updated by considering modifications performed within all classes along the i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 2D topological and direction relations in the world of minimum bounding circles

    Publication Year: 1999, Page(s):239 - 247
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    The representation and processing of spatial queries is important in numerous application domains in the areas of computer-aided design, multimedia databases, spatial and geographic applications. A sample query type in these applications is to find objects that satisfy a specific direction or topological relation with respect to a given object. Due to the large size of these databases and the comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance tradeoffs in real-time transaction processing with client data caching

    Publication Year: 1999, Page(s):403 - 407
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    Client-cached data can enhance the performance of transaction processing in a client-server DBMS. It can improve the throughput of the committed transactions and can reduce the response time of each individual transaction. Does this client data caching also lend itself to the processing of real-time transactions with timing constraints? We investigate the performance tradeoffs in real-time transac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of multidimensional array storage techniques in databases

    Publication Year: 1999, Page(s):385 - 389
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (152 KB)

    Storing multidimensional data in databases is an important topic both in the industrial and scientific database communities. Arrays are offered as a multidimensional data structure by most programming languages. Conventional database systems, however, do not support arrays of arbitrary dimensionality and base type. RasDaMan is a DBMS integrating arrays as a first class data type offering both a de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The role of meta-objects and self-description in an engineering data warehouse

    Publication Year: 1999, Page(s):342 - 350
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    As enterprises, data and functions become increasingly complex and distributed the need for information systems to be both customisable and interoperable also increases. Large scale engineering and scientific projects demand flexibility in order to evolve over time and to interact with external systems (both newly designed and legacy in nature) while retaining a degree of conceptual simplicity. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • iWebDB-Web site administration based on object-relational database technology

    Publication Year: 1999, Page(s):92 - 97
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (40 KB)

    Since the emergence of the World Wide Web in the year 1990, the number of accessible Web servers, HTML pages, and thereby the amount of accessible data have increased dramatically. Consequently many people around the world are engaged in maintaining a Web server and its content. While creating HTML pages is getting more and more simple, the administration of a Web site is still a time consuming an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Safe database queries with external functions

    Publication Year: 1999, Page(s):260 - 269
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    Considers the theory of database queries with functions in the complex-value data model. The notion of a syntactic criterion, called “embedded allowed”, for queries which guarantee embedded domain independence, is generalized for this model. We show that all “embedded allowed” calculus (or fixpoint) queries are external function domain-independent and continuous. We also de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The scalability of an object descriptor architecture OODBMS

    Publication Year: 1999, Page(s):370 - 377
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (108 KB)

    An object database management system (OODBMS) has been often criticized for its alleged insufficient scalability for a large-scale production system. We investigated the scalability issue on a commercial OODBMS with a focus on the scalability with respect to the number of objects. Our approach was a benchmark experiment using the loading and indexing of SGML text documents as an application. The a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel scalable infrastructure for OLAP and data mining

    Publication Year: 1999, Page(s):178 - 186
    Cited by:  Papers (12)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    Decision support systems are important in leveraging information present in data warehouses in businesses like banking, insurance, retail and health care. The multidimensional aspects of a business can be naturally expressed using a multidimensional data model. Data analysis and data mining on these warehouses pose new challenges for traditional database systems. OLAP and data mining operations re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transactional coordination agents for composite systems

    Publication Year: 1999, Page(s):321 - 331
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    Composite systems are collections of autonomous, heterogeneous and distributed software applications. In these systems, data dependencies are continuously violated by local operations, and therefore coordination processes are necessary to guarantee overall correctness and consistency. Such coordination processes must be endowed with some form of execution guarantees, which require the participatin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hash-based symmetric data structure and join algorithm for OLAP applications

    Publication Year: 1999, Page(s):231 - 238
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The star schema is often used in dimensional approaches applied to OLAP applications. The fact table in the star schema typically contains a huge amount of data. When some of the dimension tables are also very large, it may take too much time and storage to join the fact table with these dimension tables. The performance of the join algorithm becomes critical under such a condition. The fluent joi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The challenges of genome information management: a practical experience

    Publication Year: 1999, Page(s): 465
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (8 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient mining for association rules with relational database systems

    Publication Year: 1999, Page(s):148 - 155
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    With the tremendous growth of large scale data repositories, a need for integrating the exploratory techniques of data mining with the capabilities of relational systems to efficiently handle large volumes of data has now risen. We look at the performance of the most prevalent association rule mining algorithm-Apriori with IBM's DB2 Universal Database system. We show that a multi-column (MC) data ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SHB: a strategic hierarchy builder for managing heterogeneous databases

    Publication Year: 1999, Page(s):82 - 86
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    The paper presents a methodology based on data model translation for the management of interoperable information systems. The key feature of this solution are: 1) a set of abstract metatypes that capture the characteristics of various modeling concepts; and 2) the organization of the metatypes in a generalization hierarchy to allow unification and correlation of data models. Description logic form... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic query optimization for ODMG-93 databases

    Publication Year: 1999, Page(s):16 - 23
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    Presents a graphical technique for semantic query optimization for ODMG-93 compliant databases. The OQL object query is represented as a graph based on the information contained in the ODL object schema. The graph reflects the constraints on possible objects satisfying the query. Vertices represent objects, which may be members of interfaces, ranges of values, constant values, objects returned by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Termination analysis in active databases

    Publication Year: 1999, Page(s):288 - 297
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    Introduces a method for rule termination analysis within active databases which relies on evolution graphs simulating rule processing statically, and considering both rule activation and deactivation. The evolution graph provides a more detailed analysis than traditional graph-based approaches. We show that several termination analysis methods are captured by evolution graphs. The algorithm for te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The SDCC framework for integrating existing algorithms for diverse data warehouse maintenance tasks

    Publication Year: 1999, Page(s):206 - 214
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Recently proposed view maintenance algorithms tackle the problem of concurrent data updates happening at different autonomous information systems (ISs), whereas the EVE (Evolvable View Environment) system addresses the maintenance of a data warehouse (DW) after IS schema changes. The concurrency of schema changes and data updates still remains an unexplored problem, however. This paper provides a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database modularization design for the construction of flexible information systems

    Publication Year: 1999, Page(s):415 - 422
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (128 KB)

    Medium-sized and large private companies and public institutions usually have several operational units that enjoy increasing scope to define their own rules for the development of their activities, procedures and modus operandi. From the point of view of the development of specific software to support the activities of these organizations, this freedom means that systems must be sufficiently flex... View full abstract»

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