{"title":"New designs for priority queue machine","authors":"M. R. Meybodi","doi":"10.1109/PARBSE.1990.77129","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77129","url":null,"abstract":"Two novel designs for performing a group of priority queue operations on a set of elements are presented. Processors in either design are connected together to form a linear chain. The first machine, called a binary heap machine, is based on a heap data structure. The algorithms for XMAX and INSERT operations are different from their sequential counterparts in that they both perform the restructuring process from the top. The second machine is called a banyan heap machine. The algorithms for this machine are the generalization of heap algorithms to a more general acyclic graph called a banyan. This design requires fewer processors than the heap machine in order to meet the same capacity requirement, and unlike some of the existing designs, processors do not have geometrically varying memory sizes, resulting in a completely homogeneous system. The key advantage of the banyan heap machine is that it is possible to retrieve elements at different percentile levels.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114528243","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 modelling a type of communications in some communications intensive applications","authors":"Y.-N. Huang","doi":"10.1109/PARBSE.1990.77207","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77207","url":null,"abstract":"The author considers the problem of modeling a type of communications in some communications-intensive applications such as the parallel sort algorithm and parallel computation of the transitive closure of binary relations. The special characteristics of this type of communications are (1) every site will exchange (receive and transfer) the information with all the other sites, and (2) each site can only do one thing (receive from a site or transfer to a site) at a time. The communication which satisfies (1) and (2) is called a complete communication. A complete communication among eight sites is taken as an example.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123274485","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 efficient multiprocessor merge algorithm","authors":"P. Varman, B. Iyer, D. Haderle","doi":"10.1109/PARBSE.1990.77152","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77152","url":null,"abstract":"An efficient algorithm for merging two memory-resident sorted lists is described. The algorithm is based on a novel low-cost partitioning algorithm that is used to split the two lists among an arbitrary number of processors in a way that ensures load balance during the merge. The algorithm has direct applications in memory-resident databases, as well as for handling record pointers in disk-resident databases. It may be used for parallel sorting, table access using multiple indexes, and parallel sort-merge joins. A feature of the partitioning algorithm is that it may itself be parallelized efficiently; the parallel implementation reduces partitioning time, which may become significant if the number of processors gets large. If p is the number of processors and N is the total number of elements in both runs combined, the serial and parallel versions of the partitioning algorithm require time O(p log (N/p)), and O(log p+log(N/p)), respectively.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123314159","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 semantic database approach for tilings","authors":"N. Prabhakaran, D. Tal, M. Lenart","doi":"10.1109/PARBSE.1990.77175","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77175","url":null,"abstract":"An effort to develop computer programs that can assist or support the design process of manufacturing products having tiling structure is described. The main concept is to have a library of generic graphic programs that generate pictures of repeating patterns independently of their applications and then to modify them according to their given design task. The problem of finding feasible tilings is complex and computationally intensive. Thus, several heuristic approaches have been proposed in the literature. An efficient approach is to store constraints and graphic patterns for all known tilings in a database and use this information to simplify the feasibility problem of a new tiling. A group of constraints specifies the criteria that bound the corresponding tiling pattern. A semantic binary model is chosen to represent the graphic patterns, constraints, and relationships among them. The choice of this model is based on its unambiguous logical representation and its efficient access to data. The authors present a logical schema design to specify the information about known tilings in the database.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114456119","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":"Object migration mechanisms to support updates in object-oriented databases","authors":"M. El-Sharkawi, Y. Kambayashi","doi":"10.1109/PARBSE.1990.77163","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77163","url":null,"abstract":"Updates in object-oriented database systems are studied. It is pointed out that, owing to the richness of the object-oriented data model, updating an object may affect the object's position in the class lattice. Three types of update operations on objects are considered: adding, dropping, and modifying instance variables. An update may cause object migration, that is, the updated object may change its current class. As the user may not be aware of the side effects of the update, the system has to take some actions to complete the user's update. Classes in a database schema are classified into three types: static, partially dynamic, and dynamic. This classification is based on the way in which an object in a class may migrate. It is shown that the notion of object migration affects answering queries in temporal object-oriented databases. The history of an object will be distributed among several classes in the scheme. Two approaches to determine the class of an object's version are presented.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130581100","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 operational approach to the integration of distributed heterogeneous environments","authors":"R. Gagliardi, M. Caneve, G. Oldano","doi":"10.1109/PARBSE.1990.77162","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77162","url":null,"abstract":"The OIS (Operational Integration System) data model and query language are presented. The main goal of OIS is to provide the application environments with a uniform interface for accessing data managed by heterogeneous systems. Conceptually, OIS can be depicted as a three-level system. The integration data model level allows distributed applications to be coded in object-oriented style. The operational interface abstract level and the operational interface implementation level feature the operational mapping between application environments and distributed heterogeneous systems. It is shown how OIS features can be embedded in C++. The prototype of OIS has confirmed the modeling features of the operational integration technique adopted. Three test driving applications have been selected: (1) a file-based application for the management of textual data, using either indexed or sequential access files; (2) a graphic database related to a computer-aided-design management system; (3) a public data bank, with a TTY-oriented interface protocol accessed through telephone lines. The obtained results have encouraged the developers to enhance the OIS implementation.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123672481","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":"Optimistic multi-level concurrency control for nested typed objects","authors":"M. Cart, J. Ferrié, H. Richy","doi":"10.1109/PARBSE.1990.77199","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77199","url":null,"abstract":"The authors propose an optimistic multilevel method that also exploits commutativity of typed operations in order to enhance concurrency. One of the main advantages of this method is that it makes it possible to take commutativity depending upon return values into account. A bank-transaction example illustrating the proposed approach is presented.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124481092","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":"Optimization of response time in parallel pipelined n-joins","authors":"N. Roussopoulos, L. Tong","doi":"10.1109/PARBSE.1990.77187","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77187","url":null,"abstract":"The optimization of the response time in a parallel pipelined join of n relations is formally defined and analyzed. Multiple data-flow streams in the pipeline are captured in a parallel processing tree (PPT) that models both the parallel and the sequential aspects of the pipeline. An optimal PPT achieves minimal first-page response time by balancing the data flow in the pipeline. It is shown that the optimal PPT problem is NP-complete and that only for a very limited set of queries can one obtain optimal PPT. The authors then provide heuristic algorithms for tree and nontree queries that construct a suboptimal PPT. The dynamic feature of the PPT is developed. Experiments have been conducted to verify the performance of the PPT obtained by the heuristic algorithm.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121177342","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":"Design considerations of a fault tolerance distributed database system by inference technique","authors":"W. Chu, A. Y. Hwang, H. Hecht, A. Tai","doi":"10.1109/PARBSE.1990.77145","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77145","url":null,"abstract":"A fault-tolerant distributed database system with inference capability, consisting of a query parser and analyzer, an information module, and an inference system, is described. The information module provides the allocation and availability information of all the attributes in the system. The inference system consists of a knowledge base and an inference engine. The correlated knowledge among the attributes is represented in rules and stored in the knowledge base. During normal operations, all the database fragments are accessible; thus the processor based on the query process plan accesses the required attributes and processes the query. When network partition occurs, if the required attribute is inaccessible, the information module and the inference system will be invoked. On the basis of the required query operations provided by the parser and the correlated knowledge among the attributes, the inference engine modifies the original query to a new one so that all the required data for the query are accessible from the requested site. Depending on the type of query, the physical allocation of the database fragments, and the database domain semantics, the modified query may provide the exact, approximate, or summarized information of the original query.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131658409","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":"Logic of knowledge and belief in the design of a distributed integrity kernel","authors":"S. Ramanna, J. Peters, E. A. Unger","doi":"10.1109/PARBSE.1990.77167","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77167","url":null,"abstract":"Work on a language called ISL (Integrity Specification Language), which is intended to be used for the specification of integrity kernels in distributed databases, is reported. ISL is based on a form of interval temporal logic and provides a framework for a logic of knowledge and belief about data integrity. ISL is a design tool for integrity kernels in a distributed environment where the dynamic evaluation of data integrity based upon partial knowledge and informed judgment is required. The Clark and Wilson integrity model (1987) designed to prevent fraudulent and erroneous data modification is subsumed. An integrity system which includes extensions to the concept and functionality of a transaction manager as defined in the SDD-1 is given. A partial syntax for the ISL language is given. A temporal interval interpretation in the semantics of the 'unless' operator is introduced. This operator provides a basis for the logic of knowledge and belief applied to data integrity.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132021381","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}