[1989] Proceedings. Fifth International Conference on Data Engineering

6-10 Feb. 1989

Filter Results

Displaying Results 1 - 25 of 84
  • Proceedings Fifth International Conference on Data Engineering (IEEE Cat. No.89CH2695-5)

    Publication Year: 1989
    Request permission for commercial reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • Parallel computing with distributed shared data

    Publication Year: 1989
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Summary form only given. The issue of ease of using shared data in a data-intensive parallel computing environment is discussed. An approach is investigated for transparently supporting data sharing in a loosely coupled parallel computing environment, where a moderate to a large number of individual computing elements are connected via a high-bandwidth network without necessarily physically sharin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Term indexing for retrieval by unification

    Publication Year: 1989, Page(s):313 - 320
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    A method is presented for indexing terms in a knowledge-base retrieval-by-unification (RBU) system. The term is a well-defined structure which represents knowledge using variables. RBU operations are an extension of relational database operations using unification and backtracking to retrieve terms from term relations. The term indexing proposed uses hashing and trie structures to reduce the numbe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limiting factors of join performance on parallel processors

    Publication Year: 1989, Page(s):488 - 496
    Cited by:  Papers (15)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The effectiveness of parallel processing of relational join operations is examined. The skew in the distribution of join attribute values and the stochastic nature of the task processing times are identified as the major factors that can affect the effective utilization of parallelism. When many small processors are used in the parallel architecture, the skew can result in some processors becoming... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global information system issues

    Publication Year: 1989, Page(s):672 - 673
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    A global information system (GIS) is an umbrella system that presents a global schema of the data available in its underlying, component, autonomous information systems and provides its users with the capability to ask queries of the global scheme and to receive integrated answers. The major research areas confronting GIS developers are examined. They are: development of global schema; query proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Key-sequential access methods for very large files derived from linear hashing

    Publication Year: 1989, Page(s):305 - 312
    Cited by:  Papers (2)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    A novel class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as dynamic random-sequential access method (DRSAM) and is derived from linear hashing. With respect to previous methods DRSAM presents the following characteristics: (1) the structure captures the hashed order in consecutive storage areas so that order-preserving schemes result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated logical navigation among relations using Steiner trees

    Publication Year: 1989, Page(s):582 - 588
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The use of the Steiner tree (or the shortest connection) as a model for automatic logical navigation among relations is described. An efficient approximation algorithm is introduced for finding shortest connections. The model is extended to allow for ambiguous words in queries. The capability of this method is demonstrated by a simple database interface which is both easy to build and easy to use.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantics and efficient compilation for quantitative deductive databases

    Publication Year: 1989, Page(s):660 - 619
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 KB)

    A coherent approach is presented that extends relational and deductive database technology toward an integration of expert-system applications, which require sound and efficient capabilities to deal with uncertainty. Extending logic programming, the authors define the semantics of quantitative deductive databases, where fixpoint theory plays a central role. Calculus gives the rule programmer a gre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A robust multi-attribute search structure

    Publication Year: 1989, Page(s):296 - 304
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    A multiattribute index structure called the hB-tree is introduced. The hB-tree internode search and growth processes are precisely analogous to the corresponding processes in B-trees. The intranode processes are unique. A k-d tree is used as the structure within nodes for very efficient searching. Node splitting requires that this k-d tree be split. This produce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pragmatic estimation of join sizes and attribute correlations

    Publication Year: 1989, Page(s):76 - 84
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    A method is presented for modeling attribute value distributions in database relations for the purpose of obtaining accurate estimates of intermediate relation sizes during query evaluation. The basic idea is that instead of keeping a single (average) value to represent the number of occurrences of each attribute value, m (typically ten) parameters are kept, each representing the number o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A buffer management model for use in predicting overall database system performance

    Publication Year: 1989, Page(s):463 - 469
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    A performance model of buffer management is presented that is appropriate for use in the context of a multilayer database performance model. Some empirical evidence that supports the model's hypothesis that database page references are Bradford-Zipf-distributed is provided. A validation of the buffer performance model against data from a real-life environment is reported. Overall, the database buf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data model and access method for summary data management

    Publication Year: 1989, Page(s):242 - 249
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    A data model and an access method for summary data management are proposed. Summary data, represented as a trinary tuple <statistical function, category, summary>, consist of metaknowledge summarized by a statistical function of a category of individual information typically stored in a conventional database. The concept of category (type or class) and the additivity property of statistical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A feasibility and performance study of dependency inference [database design]

    Publication Year: 1989, Page(s):635 - 641
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The feasibility of inferring functional dependencies from an example relation is investigated. The problem occurs in the context of automatic database design, when a tool is needed to assist the database designer in the process of specifying logical dependencies. The complexity of the dependency inference problem is inherently exponential. However, algorithms could be developed that perform well w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On software and hardware techniques of data engineering

    Publication Year: 1989, Page(s):208 - 215
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    Methods are discussed to enhance the efficiency and speed of data compression techniques in DBMS (database management systems). Arithmetic coding utilizes the skewness of character distribution by assigning larger intervals (code ranges) to characters having higher probabilities of occurrence. A scheme is presented which effectively increases the code ranges of individual characters by splitting t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification as a query processing technique in the CANDIDE semantic data model

    Publication Year: 1989, Page(s):572 - 581
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    The use of classification and subsumption to process database queries is discussed. The data model, called CANDIDE, is essentially an extended version of the FL-1, KANDOR and BACK, frame-based knowledge representation languages. A novel feature of the approach is that the data-description language and data-manipulation language are identical, thus providing uniform treatment of data objects, query... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Materialization and incremental update of path information

    Publication Year: 1989, Page(s):374 - 383
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    The problem of efficiently processing recursive path queries in deductive database systems is discussed, and a semimaterialized encoding structure is proposed as an attractive approach that provides a balance between efficiency of retrieval and feasibility of storage. Incremental algorithms are presented that enable the effects of updates to the underlying database to be reflected in the materiali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design of the cell tree: an object-oriented index structure for geometric databases

    Publication Year: 1989, Page(s):598 - 605
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    The design of the cell tree, an object-oriented dynamic index structure for geometric databases, is described. The data objects in the database are represented as unions of convex point sets (cells). The cell tree is a balanced tree structure whose leaves contain the cells and whose interior nodes correspond to a hierarchy of nested convex polyhedra. This index structure allows quick access to the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel computing; one opportunity, four challenges

    Publication Year: 1989, Page(s):482 - 484
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB)

    Integration technologies for parallel computing are discussed. Requirements imposed by the need to properly interconnect large numbers of processing elements are emphasized. Four topics discussed as cornerstones in the field of parallel computing are programmability, communication network design, reliable operation, and performance evaluation and benchmarking View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The role of loose coupling in expert database system architectures

    Publication Year: 1989, Page(s):255 - 256
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    The author maintains that loose AI-DBMS (artificial intelligence-database-management system) coupling will thrive in the future. The specific approaches adopted for the coupling (loose or tight) of AI-DBMS systems will depend on engineering, economic, social, organizational factors. A number of applications involving the processing of knowledge and data are presented and classified in terms of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraints for improving the generation of intentional answers in a deductive database

    Publication Year: 1989, Page(s):652 - 659
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    It is shown how intentional answers can be generated as logical consequences of the query and of deduction rules and how integrity constraints can filter out inadequate answers and produce simpler and more informative answers. An efficient organization for the combination of answers and constraints is presented. The authors focus on the design of mechanisms for controlling the generation of intent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge-based support for the development of database-centered applications

    Publication Year: 1989, Page(s):394 - 401
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Using the Application Development Toolkit (ADT) as an example, it is shown that by borrowing some techniques from the artificial-intelligence field, database-centered application-development productivity tools can be made more acceptable to end users and more useful to expert developers. Experience with ADT has indicated that a more end-user-oriented approach, and, in particular, more accommodatin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating AI and DBMS through stream processing

    Publication Year: 1989, Page(s):259 - 260
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    An approach is presented for integrating AI (artificial intelligence) systems with DBMS (database management systems). The impedance mismatch that has made this integration a problem is, in essence, a difference in the two system models of data processing. The present approach is to avoid the mismatch by forcing both AI systems and DBMS into the common model of stream processing. The approach take... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing vote and quorum assignments for reading and writing replicated data

    Publication Year: 1989, Page(s):271 - 279
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (604 KB)

    The problem is discussed of determining the vote assignment and quorum that yields the highest availability in a system where node availabilities can be different and the mix of the read and write operations is arbitrary. For this purpose, an enumeration algorithm is presented that can be used to find the vote and quorum assignments that need to be considered for achieving optimal availability. An... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards efficient algorithms for deadlock detection and resolution in distributed systems

    Publication Year: 1989, Page(s):287 - 294
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (672 KB)

    A theoretical framework for wait-for systems is provided, and general characteristics of a correct algorithm for deadlock detection and resolution are presented. It is shown that the computational upper bounds (number of messages) for deadlock detection and resolution are both O(n3) in the worst case when n transactions are involved. This result is better than previous... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LINDA: a system for loosely integrated databases

    Publication Year: 1989, Page(s):66 - 73
    Cited by:  Papers (9)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    LINDA, an experimental system for database access in heterogeneous environments, is discussed. The goal is to achieve maximum site autonomy and as much database access homogenization as possible. The problems to be solved are discussed, and design priorities are justified. Major heterogeneity problems are sketched, and the applied techniques are briefly described. An overview of the implementation... View full abstract»

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