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
  • 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.
  • A workflow management systems architecture that support ad-hoc recoveries

    Publication Year: 1999, Page(s):332 - 340
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB)

    Ad-hoc recovery is a phenomenon that occurs in workflow applications when an agent needs to alter the control flow prescribed in the original definition. It is usually caused by unpredictable reasons, such as an unexpected output of some individual tasks, events or exceptions due to the changing environment, etc. Due to its irregularity in nature, ad-hoc recovery in general cannot be dealt with by... 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.
  • New access index for fast execution of conjunctive queries over text data

    Publication Year: 1999, Page(s):248 - 253
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (116 KB)

    Complex queries with multiple conjunctive (AND) predicates have attracted increasing attention for their importance in OLAP systems. The signature index is ideal for the fast execution of queries involving multiple conjunctive predicates. However, previous signature-based methods did not separate the signatures from different attributes. We have developed a signature-augmented access index, called... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locking with different granularities for reads and writes in an MVM system

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

    Investigates the use of a multi-view virtual memory (MVM) in providing efficient locking services for transaction processing or database systems. The locking granularity is customizable by applications and, furthermore, the locking granularities for read and write operations may differ. The system provides for the enforcement of access control protocols on units of a memory region through finite s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Management of multidimensional aggregates for efficient online analytical processing

    Publication Year: 1999, Page(s):156 - 164
    Cited by:  Papers (4)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    Proper management of multidimensional aggregates is a fundamental prerequisite for efficient OLAP. The experimental OLAP server CUBESTAR whose concepts are described, was designed exactly for that purpose. All logical query processing is based solely on a specific algebra for multidimensional data. However, a relational database system is used for the physical storage of the data. Therefore, in po... 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.
  • Parallelizing user-defined functions in distributed object-relational DBMS

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

    Full support of parallelism in object-relational database systems (ORDBMSs) is desired. The parallelization techniques developed for relational database systems are not adequate for ORDBMS because of the introduction of complex abstract data types and operations on ordered domains. In this paper, we consider a data stream paradigm and develop a query parallelization framework that exploits charact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recovery protocols in multi-agent probabilistic reasoning systems

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

    Introduces a probabilistic relational data model as the basis for developing multi-agent probabilistic reasoning systems. Since our model subsumes the traditional relational data model, it immediately follows that we can take full advantage of the existing distributed and concurrency control techniques to address the undesirable characteristics exhibited by current multi-agent probabilistic reason... 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.
  • 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.
  • 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.
  • Site-locking protocol for global concurrency control in multidatabase systems

    Publication Year: 1999, Page(s):380 - 384
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    Much research into managing global transactions in multidatabase systems (MDBS) has been proposed to solve problems of ensuring global serializability. In these methods, a few opportunities are provided to the global transaction to execute concurrently. We concentrate our attention on 1) maintaining a consistent database state that is defined by global integrity constraints, and 2) investigation i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A user interface for distributed multimedia database querying with mediator supported refinement

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

    The DelaunayMM system supports an interactive, customizable interface for querying multimedia distributed databases, such as digital libraries. Through this interface, users select virtual document styles that cater the display of query results to their needs, while also offering transparent preand post-query refinement and querying. DelaunayMM's virtual documents preserve co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A heuristics-based approach to query optimization in structured document databases

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

    The number of documents published via the World Wide Web in the form of SGML/HTML has been rapidly growing for years. Efficient, declarative access mechanisms for this type of document-structured documents in general-are becoming of great importance. This paper reports our most recent advance in pursuit of the effective processing and optimization of structured document queries, which are importan... 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.
  • Feature reduction and database maintenance in NETNEWS classification

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

    We propose a statistical feature reduction technique to filter out the most ambiguous articles in the training data for categorizing NETNEWS articles. We also incorporate a batch updating scheme to periodically do maintenance on the term structures of the news database after training. The baseline method combines the terms of all the articles of each newsgroup in the training set to represent the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The MIDAS data-mining project at Stanford

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

    The article summarizes recent research into data-mining techniques that are in progress at Stanford: 1. The Google search engine: beating Yahoo et al. at their own game. 2. Query flocks: generalizing association rules/market baskets in a query precompiler that uses a relational DBMS effectively. 3. Synthesizing knowledge from the Web: exploiting the Web's redundancy to extract data automatically. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive data analysis on numeric-data

    Publication Year: 1999, Page(s):226 - 230
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    Data mining has been a hot topic in computer science. Many researchers have been putting lots of effort into how to extract explicit knowledge from large databases. Among the problems in data mining, finding useful patterns in large databases has attracted lots of interest in recent years. However, like other data mining algorithms, most of the proposed clustering algorithms suffer from the same d... 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.
  • 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.
  • 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 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.