{"title":"Visualization of path expressions in a visual object-oriented database query language","authors":"Jeonghee Kim, Taisook Han, Suk-Kyoon Lee","doi":"10.1109/DASFAA.1999.765741","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765741","url":null,"abstract":"Path expressions have been accepted for concisely manipulating the nested structures in complex object-oriented query expressions. However, previous visual query languages hardly represent such query expressions in a concise and intuitive way partly due to improper visual representation of path expressions and partly due to lack of well-defined system and semantics of languages. In this paper, we present visual modeling of path expressions in a visual object-oriented database query language called Visual Object-Oriented Query Language (VOQL) which has excellent expressive pourer for sets, simple and intuitive syntax, and well-defined semantics. This is enabled by explicitly specifying the semantics of multi-valued path expressions based on the visual notation capable of representing set relationships in addition to functional relationships. The basic visual constructs called blobs and nested blobs denote sets of objects that path expressions represent while the constructs called binding edges and flattening edges visually simulate the notions of variable binding and dot functions in path expressions respectively. Based on the constructs, the grammar of VOQL defines the syntactic components while the semantics of query expressions are provided by syntax-directed translation to the counterparts in the extended relational calculus. Also, the visual constructs allow modeling of restricted universal quantification with a visual scoping box and effectively represent nested quantification and recursive queries without semantic ambiguities.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"23 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113936448","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":"Development of multi-step filtering processor","authors":"Miyeon Kim, Suhyun Lim, Jangsu Kim","doi":"10.1109/DASFAA.1999.765749","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765749","url":null,"abstract":"Spatial query processing using a spatial access method (SAM) faces the problem of having to examine a large number of candidate objects during the CPU-time intensive refinement step. This is due to the minimum bounding rectangle (MBR) filter in the first step of query processing which is rough by nature. In order to overcome this problem, the multi-step filtering method that takes a series of spatial filters with higher filtering ratios than that of the MBR in a cascade fashion for the object set already filtered by an MBR has been introduced. Most of the spatial filters were only able to manage areal objects. In this paper, we propose the minimum maximum points (MMP) filter, a spatial filter that can manage not only areal objects but also linear objects. In addition, we propose a multi-step filtering processor using the MMP filter, which is designed for the well-known spatial operator respectively. We also show the superiority of our multistep filtering by extensive experiments.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"404 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122944557","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 and implementation of a CORBA query service accessing EXPRESS-based data","authors":"Jürgen Sellentin, B. Mitschang","doi":"10.1109/DASFAA.1999.765761","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765761","url":null,"abstract":"We describe the design and implementation of a CORBA query service targeted to access data that is defined by the EXPRESS data modeling language. EXPRESS is used primarily in engineering domains (like CAD/CAM and GIS) to describe mostly product model data (like parts explosion or product geometry). In order to bring query facilities for EXPRESS-based data to CORBA a number of design decisions have to be taken, although the CORBA query service is standardized by the OMG. Among the most important and performance-indicating decisions are the definition of an appropriate query language and the description of the query result data structures. We discuss solutions to these topics and report on the experiences gained in designing and implementing our first CORBA query service for EXPRESS-based data.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121632664","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":"/spl Pi/-web join in a web warehouse","authors":"S. Bhowmick, S. Madria, W. Ng, Ee-Peng Lim","doi":"10.1109/DASFAA.1999.765759","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765759","url":null,"abstract":"With the enormous amount of data stored in the World Wide Web, it is increasingly important to design and develop powerful web warehousing tools. The key objective of our web warehousing project, called WHOWEDA (Warehouse of Web Data), is to design and implement a web warehouse that materializes and manages useful information from the web. We introduce the concept of /spl Pi/-web join in the context of WHOWEDA. /spl Pi/-web join operator is a web information manipulation operator to combine relevant web information residing in two web tables. Informally, it is the combination of web join and web project operators which filter out irrelevant information from a joined web table. We show how to construct the /spl Pi/-joined web table and its schema. We also highlight the benefits of the /spl Pi/-web join operator.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131604807","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}
Sun Hwan Kim, Minkyu Jung, Jun Hyun Park, Young Chul Park
{"title":"A design and implementation of savepoints and partial rollbacks considering transaction isolation levels of SQL2","authors":"Sun Hwan Kim, Minkyu Jung, Jun Hyun Park, Young Chul Park","doi":"10.1109/DASFAA.1999.765764","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765764","url":null,"abstract":"A partial rollback of a transaction restores the state of the transaction and the database to the state in which they have been right after the savepoint to be rolled back has been established. The paper considers the correctness of savepoints and partial rollbacks. First, a savepoint sequence number is assigned to each savepoint. According to that, without generating any savepoint log record upon establishing savepoints, all the valid savepoints of a transaction can have different savepoint sequence numbers and the order of establishment of each valid savepoint can be discriminated efficiently. Second, the lock request entries of the manual duration are not deleted from the lock table as far as some savepoints which are established after the locks are requested but before the locks are released are valid. That guarantees the correctness of savepoints and partial rollbacks under the circumstances of supporting the four transaction isolation levels of SQL2. Third, the concept of the mini-savepoint that preserves the atomicity of update operations of the SQL level is extended and adopted to triggers and stored procedures. According to that, the atomicity of triggers and stored procedures is supported and the scope of savepoint names is restricted to the internal of the corresponding triggers or stored procedures.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114222525","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":"Spatial presentation and aggregation of georeferenced data","authors":"Kengo Koiso, Takahiro Matsumoto, Katsumi Tanaka","doi":"10.1109/DASFAA.1999.765747","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765747","url":null,"abstract":"In this paper, we introduce a method of spatial presentation of georeferenced data in a three-dimensional space. Photographs, Quicktime VRs, videos, and computer graphic renderings provide realistic presentations rich in visual information. We believe, however, there is an issue of visualizing georeferenced data such as attribute data for spatial objects as well as showing the objects themselves. We introduce an orientation-based visualization model for visualizing georeferenced data, and discuss abstraction of the georeferenced data through their spatial aggregation in the space specified by a user.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122589606","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 middleware implementation of active rules for ODBMS","authors":"S. Yoo, Ki-Chang Kim, S. Cha","doi":"10.1109/DASFAA.1999.765769","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765769","url":null,"abstract":"Throughout many research and development projects for active rule systems, active rules are implemented with different syntax and semantics. It becomes one of the stumbling blocks to apply active database systems especially in networked heterogeneous multidatabase environments. Utilizing the recent development of CORBA and ODMG standards, a middleware approach to provide active rule systems for heterogeneous ODBMS is presented in this paper. The active rule system described is applied for integrity maintenance of spatial objects. According to the events included in application programs, the active rules represented in ECA type are inserted into the program by a preprocessor. One advantage of this compile approach is that the preprocessed program can be compiled and executed without the overhead of runtime monitoring. For the changed rules after compilation, a run time interpreter is included in the executable program.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124590384","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":"Change management with roles","authors":"Sven-Eric Lautemann","doi":"10.1109/DASFAA.1999.765763","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765763","url":null,"abstract":"Various proposals have been made to extend object-oriented languages and database systems with roles because they allow to weaken strict typing concepts and therefore can provide mechanisms for an object to change its type during its lifetime. This so-called object migration is not the only advantage offered by a suitable role model. This paper studies the possibilities to use roles for a general change management system that also includes support for schema evolution. OPAQUE, as the selected role model, can be extended with schema update mechanisms in a surprisingly clean and straightforward way including the concepts of versions and views as well.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132525450","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":"Maintenance of placement dependency in distributed multidatabase systems","authors":"Hao Chen, Chengwen Liu","doi":"10.1109/DASFAA.1999.765768","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765768","url":null,"abstract":"Placement dependency is a data allocation constraint in distributed multidatabase systems. It has been shown that this constraint can be used to speed up query processing. However, update operations may violate placement dependency. It is important to support the maintenance of placement dependency in distributed multidatabase systems. We present a method for maintaining placement dependency. We discuss how this method is used to test whether update operations will violate placement dependency and provide general resolutions for update operations that violate placement dependency.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133228568","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}