{"title":"Flow sketch methodology: A practical requirements definition technique based on data flow concept","authors":"Y. Matsumoto, Tomohide Shibata, M. Tani","doi":"10.1109/ICDE.1984.7271291","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271291","url":null,"abstract":"This paper discusses a new simple methodology for defining software system requirements. We have developed a practical approach which we call FS (Flow Sketch) methodology. This methodology, based on the data flow concept, has been developed to provide the precise means of user's requirements. Actually, the user's requirements are presented in data form by particular format cards. Data are classified and the relationships between data are decided through brainstorming. Then, a requirement definition model is defined. FS methodology employs diagrammatic notation. This notation is suitable for the visual and the interactive description of the dynamic system data flow. As a result, misunderstandings of the software system between the software producer and software user will decrease.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124153805","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":"The file-assignment and query-processing problems in local multiaccess networks","authors":"B. Wah, Y. Lien","doi":"10.1109/ICDE.1984.7271276","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271276","url":null,"abstract":"In this paper the distribution-design and query-processing problems for distributed databases on local multiaccess computer networks are studied. The broadcast capability of these networks allows information to be distributed efficiently. In the distribution-design problem, the distribution of independent files are studied. With the broadcasts of updates, the distribution of multiple copies of a single file can be solved optimally in polynomial time. However, the general problem with storage-capacity constraints is still NP-hard, and an efficient branch-and-bound method is proposed. In the query-processing problem, the semi-join concept is adopted. The propagation of reduction on dependent attributes is studied. Although the problem is NP-hard, less data transmission is needed with the broadcast of information.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129722692","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":"Distributed query evaluation in local area networks","authors":"G. M. Sacco","doi":"10.1109/ICDE.1984.7271313","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271313","url":null,"abstract":"Heuristic strategies to solve multirelational queries in local area networks using broadcast routing are presented. In broadcast routing (used in broadcast and ring networks), data transmitted by one site are received by all the other network sites. This fact is exploited to derive new strategies to minimize a linear combination of query response and total time.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126269592","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}
G. Belford, J. Liu, D. Cho, P. Cotten, S. England, J. D. Goldstein, S. C. Hwung, K. Kaufman, C. K. Kim, J. Leo, A. P. Manolas, A. Moon, A. D. Smet, Y. L. Yan, L. Zhang, G. L. Robinson, R. Lapp
{"title":"Mutual consistency maintenance in a prototype Data Traffic Management System","authors":"G. Belford, J. Liu, D. Cho, P. Cotten, S. England, J. D. Goldstein, S. C. Hwung, K. Kaufman, C. K. Kim, J. Leo, A. P. Manolas, A. Moon, A. D. Smet, Y. L. Yan, L. Zhang, G. L. Robinson, R. Lapp","doi":"10.1109/ICDE.1984.7271324","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271324","url":null,"abstract":"This paper describes the mutual consistency maintenance mechanism used in a prototype Data Traffic Management System (DTMS), which was designed and implemented to integrate several independent and stand-alone data systems owned by the U. S. Army, Corp of Engineers (CE). The major design constraints were that no modification to the data systems involved were allowed and that the update to each duplicate copy was to be handled as automatically as possible and in a manner approved by the manager of the system containing the copy. The capabilities of the prototype DTMS and the Mutual Consistency Maintenance Subsystem are discussed. The linkage directory used to support mutual consistency maintenance and the mutual consistency maintenance mechanism are described.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121260093","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":"Matching techniques in global schema design","authors":"M. Mannino, W. Effelsberg","doi":"10.1109/ICDE.1984.7271301","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271301","url":null,"abstract":"A global schema is an integrated view of heterogeneous databases. Identifying common types of information from the various local Schemas is an important part of designing a global schema. After matching the entity types and attributes, the designer constructs the global schema by applying a set of integration operators. In this paper, we propose two types of matching techniques and discuss their use in global schema design. Entity type matching partitions the entity types of the local Schemas into subsets with common information. Attributes within each entity type cluster are then matched according to the similarity of their meaning and scope. We define assertion types for both kinds of matching and provide an algorithm to check the consistency and completeness of attribute assertions.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126909568","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":"Programming language support for real-time distributed systems","authors":"T. LeBlanc","doi":"10.1109/ICDE.1984.7271295","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271295","url":null,"abstract":"This paper advocates the use of a high-level, distributed programming language for programming realtime distributed systems. The advantages of this approach include the program structure imposed by an appropriate language design, static checking provided by the compiler, and efficient execution. A structured approach to the issues of user control of machine dependencies, process scheduling, timing constraints, and interprocess communication is suggested, with specific examples drawn from modern programming languages designed for realtime and distributed programming.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126914124","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":"Dynamic data structures on optical disks","authors":"Peter K. Rathmann","doi":"10.1109/ICDE.1984.7271270","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271270","url":null,"abstract":"Current data structures for online secondary storage depend on the ability to alter data once it is written. On an optical disk such modification is not possible, so new approaches are needed. In this paper, data structures which allow additions, logical deletions, and rapid access to data stored on optical disks are proposed and analyzed.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126535867","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":"On the effectiveness of fault-tolerance techniques in parallel associative database processors","authors":"A. Avizienis, A. F. Cardenas, Farid Alavian","doi":"10.1109/ICDE.1984.7271254","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271254","url":null,"abstract":"Fault-tolerance is systematically applied to the organization of a parallel associative (content addressable) database processor. Storage areas are protected by duplication and by error detecting and/or correcting codes. A duplex Checking Unit is introduced to check the reading and writing operations. Individual Area Processors are employed to search the storage areas. They are protected by duplexing or triplexing with or without sparing. Effectiveness of these fault-tolerance techniques is assessed by means of reliability predictions for a 100-storage area system. The UCLA ARIES reliability modeling program is employed to obtain the reliability predictions. Major gains in system reliability are demonstrated, and relative effectiveness of alternate approaches is analyzed.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"73 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114005240","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":"Supporting the design of conceptual schemata by database systems","authors":"H. Wedekind","doi":"10.1109/ICDE.1984.7271303","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271303","url":null,"abstract":"Designing the conceptual schema of databases is mainly a task of understanding the application world rather than applying a data model to specific situations. In spite of making use of formal terms like functional dependencies, relations etc. experiences in consulting show that a design process should reflect a learning situation and has to start with comprehensible, simplest (i.e. elementary) sentences. A strict constructive approach is outlined guaranteeing that new complex sentences can only be introduced by means of sentences already available to the designer. The structure of the metadatabase is outlined and an implemented design system is described.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128669209","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":"Version-based access capabilities for concurrency control of a database system","authors":"Toshimi Minoura, K. Parsaye","doi":"10.1109/ICDE.1984.7271286","DOIUrl":"https://doi.org/10.1109/ICDE.1984.7271286","url":null,"abstract":"Version-based access capabilities (V-capabilities) that can be used for concurrency control of a database system are introduced. A V-capability is an access capability for a version of a data item. If transactions are allowed to access only those versions whose V-capabilities are possessed by them, consistent operation of a database system can be realized by properly controlling the issuance of V-capabilities. Since the issue times of V-capabilities can be different from their use times, V-capabilities add another dimension to the concurrency control of a database system.","PeriodicalId":365511,"journal":{"name":"1984 IEEE First International Conference on Data Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128793211","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}