{"title":"Subclasses equal instances, thanks to statistical databases","authors":"N. Rowe","doi":"10.1109/ICDE.1987.7272387","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272387","url":null,"abstract":"The Enterprise is an aircraft carrier. An aircraft carrier is a ship. Is the relationship of the concept “Enterprise” to the concept “aircraft carrier” the same as the relationship of “aircraft carrier” to “ship”? Many researchers in artificial intelligence say no, calling the first an “instance” or “element” relationship, the second a “subclass” or “a kind of” relationship (e.g., Winston p.258). But I disagree—I think the two relationships are exactly the same. That's a controversial statement, but in fact, I'll take an even stranger stand here: I claim that statistical databases have something to do with it.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130678031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Concurrency control by pre-ordering entities in databases with multi-versioned entities","authors":"Mohan L. Ahuja, J. Browne","doi":"10.1109/ICDE.1987.7272396","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272396","url":null,"abstract":"This paper presents a protocol for improving concurrency and preserving consistency in databases with multi-versioned entities: the database could be either centralized or distributed and may or may not have data replication. In the proposed protocol entities are assigned an order and each transaction accesses entities in this order, with possibly skipping entities that need not be accessed: the out-of-order accesses are permitted at an additional costs. Also, each transaction carries with it, as it moves along the pre-ordered entities, the state information about all preceding transactions which must execute logically before this transaction at all succeeding entities to ensure serializability of transactions. At each entity, a transaction executes logically after all the transactions in the state carried to the entity by the transaction.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127968379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multidimensional dynamic quantile hashing is very efficient for non-uniform record distributions","authors":"H. Kriegel, B. Seeger","doi":"10.1109/ICDE.1987.7272349","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272349","url":null,"abstract":"Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffers from several disadvantages. In a recent paper we have suggested a multidimensional dynamic hashing scheme which exhibits better retrieval performance than its competitors for uniform distribution. The even more severe second disadvantage of all known multidimensional dynamic hashing schemes is the very poor performance for non-uniform record distributions. In this paper we present the quantile method as a scheme which exhibits for non-uniform distributions practically the same performance as for uniform distributions. This is underlined by experimental runs with an implementation of our scheme. In addition to its excellent performance, our scheme fulfills all the necessary requirements to be used in an engineering database system: it is dynamic, is suitable for secondary storage devices, supports point data and spatial data objects and supports spatial clustering (proximity queries).","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126743912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Parallel processing of relational databases on a cellular tree machine","authors":"Alexis Koster","doi":"10.1109/ICDE.1987.7272374","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272374","url":null,"abstract":"This paper investigates the use of a cellular tree computer, the FFP machine, for parallel processing of relational databases. This machine directly executes Formal Functional Programming (FFP) code. A method to embed SQL statements in FFP programs is described. Schemes for parallel implementation of simple retrieval statements are presented for different I/O architectures. Then techniques for parallel implementation of more complex retrieval statements are given. Because the FFP machine can accommodate the almost unbounded parallelism of FFP programs, execution time analysis shows potential for highly efficient execution of relational database queries on this machine. Modifications of the FFP machine to speed up input/output operations are discussed.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"117 4 Suppl 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123242854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Symbolic processing: Issues and opportunties","authors":"T. Welch","doi":"10.1109/ICDE.1987.7272393","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272393","url":null,"abstract":"Symbolic processing is distinguished from other types of computation, e.g. numeric, commercial, or real-time, by the fact that its metadata is both complex and complicated. That is, the data objects manipulated by symbolic programs have descriptions which are not simple and not always predictable. The metadata is complex in the sense that the data objects are multi-faceted, having a variety of attributes and relationships to other objects. Processing this multidimensional data is done in slices, involving just a few types of attributes at a time, so different programs must deal with different projections (or views) of the data. The metadata is complicated in that it is recursive, meaning that the interpretation of a data object requires processing other instances of the same object class, to an unpredictable extent. Thus complexity and complication in metadata translate directly into data management and resource (space and time) management problems in processing.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126614875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A statistical interface for historical relational databases","authors":"A. Tansel","doi":"10.1109/ICDE.1987.7272421","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272421","url":null,"abstract":"A historical database is a vast source of data for statistical analysis. The paper presents a statistical interface for historical relational databases with an underlying data model which uses attribute time-stamping. The statistical interface we propose includes aggregate functions and transformations of data into tabular forms suitable for advanced statistical analysis and is capable of dealing with the subtle semantics of time and various issues associated with it. A new operation, called enumeration, is introduced into historical relational algebra. The enumeration operation derives a table of uniform data, for a set of specified time points or intervals, from a three dimensional historical relation. We also give a method for normalizing historical relations and aligning the time of their attributes.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115178599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Controlled cooperation in engineering database systems","authors":"K. Dittrich","doi":"10.1109/ICDE.1987.7272418","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272418","url":null,"abstract":"Database systems for engineering applications must be particularly efficient in storing and retrieving very complex structures. But they must also be capable of assisting in the project-oriented cooperation of design engineers by supporting the controlled exchange of stored information. The latter aspect has not been given much emphasis in the past; and the few proposals found in the literature all deal with extending the database system's transaction concept. This paper presents an alternative approach that is orthogonal to transactions and thus is much simpler to understand and to implement.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132693841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"What do you mean “null”? Turning null responses into quality responses","authors":"Mimi Kao, N. Cercone, W. Luk","doi":"10.1109/ICDE.1987.7272401","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272401","url":null,"abstract":"When natural language front-ends are introduced to database management systems, generation of quality responses have proven problematical in situations when null values arise. In our work, in which we assume the database query language is SQL, we present methods for responding with appropriate answers to null value responses. To do so we use a knowledge base based on RM/T, an extended relational model proposed by E. F. Codd. The advantages of this approach are described. To demonstrate the utility of the knowledge base, a simple knowledge base is constructed. A detailed algorithm is given to provide additional information when a null answer is returned.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128686402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An expert system interface and data requirements for the integrated product design and manufacturing process","authors":"Dana E. Madison, C. T. Wu","doi":"10.1109/ICDE.1987.7272430","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272430","url":null,"abstract":"Database technology has been successfully applied to the traditional data processing environment where data are represented by well-formatted records. There is a growing interest in extending this database technology to more advanced application environments such as VLSI CAD/CAM, cartography, etc., where data are less structured and have very complex semantics. In this paper, we describe the data interactions in the design and manufacturing phases which are necessary to integrate the two phases automatically. These data requirements are part of an integrated information support system geared towards the “make to order” design and manufacturing process. An expert system translator to carry out the integration is described and demonstrated in an example. An overall goal of our research is to determine the database support necessary for a completely integrated information support system for generic design and manufacturing processes.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121135651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Generalized pictorial data management","authors":"A. F. Cardenas","doi":"10.1109/ICDE.1987.7272389","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272389","url":null,"abstract":"The collection and processing of digital image or pictorial data based on photographs, drawings, maps, etc. is undergoing a period of rapid growth. Industry, universities, and governmental and military agencies are producing an ever increasing volume and variety of such data. For many years special image data handling systems have been developed to store and retrieve specific types of pictorial data. More recently, however, it has been realized that instead of the one-of-its-kind type of approach, the generalized pictorial data base management system approach is the preferred approach (much in the same way that today's DBMS for record-type data are unquestionably preferred in most eases over tailor-made one-of-its kind systems).","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121227628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}