{"title":"A restructuring method for the concurrent B/sup +/-tree based on semantic consistency","authors":"Sungchae Lim, Yoonjoon Lee, Myoung-Ho Kim","doi":"10.1109/DASFAA.1999.765756","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765756","url":null,"abstract":"As the B-tree index could be a performance bottleneck in database systems, concurrent B-tree algorithms have been intensively studied to improve concurrency of B-tree accesses in the literature. We propose a new concurrent B/sup +/-tree algorithm for high concurrency and an efficient tree restructuring method. Because the proposed method of tree restructuring always preserves a semantic consistency of the B/sup +/-tree, a key searcher need not require any lock for a range search as well as a single-key search. To maintain correctly the link fields constructed at the leaf level, we make each leaf node contain two key-range indicators, and develop a tree restructuring method using these key-range indicators.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"23 8 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":"125669811","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":"Mining exception instances to facilitate workflow exception handling","authors":"San-Yih Hwang, Sun-Fa Ho, Jian Tang","doi":"10.1109/DASFAA.1999.765735","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765735","url":null,"abstract":"The importance of exception handling within the context of workflow management has been widely recognized. While some exceptions are expected at design time and thus can be incorporated into the workflow design via some flexible mechanism, others are totally unexpected. Previous work in handling unexpected workflow exceptions focuses on the run-time support to, for example, allow the rollback of some already completed activities, validate the correctness of dynamic workflow change, and deploy a solution to handle exceptions. Authorized persons are responsible for deriving solutions to handle exceptions. We propose a novel approach to facilitating users in proposing solutions for resolving a given exception. Specifically, our approach scans through the previous records in handling exceptions, looking for those that are close to the current exception. The ways in which those exceptions were handled serve as useful information in determining how to handle the current one. Several algorithms are proposed and evaluated through both theoretical analysis and a synthetic data set.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"1 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":"130152793","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":"Research and development of advanced database systems for integration of media and user environments","authors":"Y. Kambayashi","doi":"10.1109/DASFAA.1999.765730","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765730","url":null,"abstract":"With rapid growth of recent development of computer and network technologies, the amount of data produced, transmitted and stored is growing enormously. The variety of data to be processed is widely spreading all over the world. We are facing the third communication revolution after the invention of printing technology and mass-communication. Databases are key technology for the coming network-age. To promote such research areas, Japanese Ministry of Education, Science, Sports and Culture had decided to sponsor the Scientific Research on Priority Areas entitled \"Research and Development of Advanced Database Systems for Integration of Media and User Environments\" (Research Project on Advanced Databases, in short.).","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"55 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":"134372355","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":"P-tree: a B-tree index for lists","authors":"Ke Wang, B. Ooi, S. Sung","doi":"10.1109/DASFAA.1999.765755","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765755","url":null,"abstract":"The high frequency of applications involving large, ordered, nested lists suggests that list is the \"next most\" natural data type after set. A list differs from a set through positioning and nesting elements within the list. Directly supporting such position-related operations will greatly improve the performance of database systems targeting at the above applications. Unlike other attributes, the position will be changed by insertion and deletion within a list and known methods are not appropriate for indexing the position. We present an indexing structure, called the P-tree (where P for position), to index a set of lists. The P-tree generalizes the B-tree by dealing with a set of lists rather than a set of records, while preserving all the properties of the B-tree.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"23 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":"132764918","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":"Data mining and personalization technologies","authors":"Philip S. Yu","doi":"10.1109/DASFAA.1999.765731","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765731","url":null,"abstract":"Data mining has become increasingly popular and is widely used in various application areas. In this paper, we examine new developments in data mining and its application to personalization in E-commerce. Personalization is what merchants and publishers want to do to tailor the Web site or advertisement and product promotion to a customer based on his past behavior and inference from other like-minded people. E-commerce offers the opportunity to deploy this type of one-to-one marketing instead of the traditional mass marketing. The technology challenges to support personalization are discussed. These include the need to perform clustering and searching in very high dimensional data space with huge amount of data. We examine some of the new data mining technologies developed that can support personalization.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"22 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":"133819670","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 Web-based database application development","authors":"Quan Xia, Ling Feng, Hongjun Lu","doi":"10.1109/DASFAA.1999.765732","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765732","url":null,"abstract":"This paper discusses our experiences of designing and implementing a pure Java database proxy server with a JDBC compatible driver for intranet/Internet database application development. In particular, we present a shared database connection strategy and flexible caching facilities to address the scalability problem. Web clients with the same access privilege can maintain their logical connections with shared physical connections to the database. Thus, not only a large number of users can be entertained by limited physical resource, the connection cost is also not indulged for each individual client. Web clients can also express their cache requirements explicitly in the JDBC protocol so that a large number of clients can be served with improved response time. The effectiveness of such strategies is demonstrated through a set of experiments.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"2 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":"121316019","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}
Botao Wang, Hiroyuki Horinokuchi, K. Kaneko, A. Makinouchi
{"title":"Parallel R-tree search algorithm on DSVM","authors":"Botao Wang, Hiroyuki Horinokuchi, K. Kaneko, A. Makinouchi","doi":"10.1109/DASFAA.1999.765757","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765757","url":null,"abstract":"Though parallel database systems have been extensively studied, as far as we know, the parallel algorithms of R-tree proposed so far are limited to one workstation with multiprocessors or multi disks, where a parallel sorting algorithm or concurrent I/O is used to improve the performance. For the searching of R-trees, multiple search paths from the root to leaves are traversed sequentially. This sequential traverse can be transformed into multiple parallel traverses based on multiple search paths, where the query is divided into subqueries which can be executed concurrently. Aiming at parallel I/O and CPU operations, we introduce a parallel R-tree search algorithm running on distributed shared virtual memory (DSVM), especially on Shusseuo which is an ODBMS providing global persistent object management on persistent DSVM. The related problems are discussed and the evaluations are made based on Shusseuo. Experimental results show that optimal performance can be reached in dealing with large volumes of data.","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":"122740174","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}
Sung-Geun Han, Jeong-Han Son, Jae-Woo Chang, Z. Zhoo
{"title":"Design and implementation of a structured information retrieval system for SGML documents","authors":"Sung-Geun Han, Jeong-Han Son, Jae-Woo Chang, Z. Zhoo","doi":"10.1109/DASFAA.1999.765739","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765739","url":null,"abstract":"SGML has become very popular as the source language of structured documents because its usefulness has already been verified by the CALS (Commerce At Light Speed) project. Traditional information retrieval systems (IRSs), however, cannot support retrieval based on the logical structure of SGML documents. In this paper, we design a structured IRS (SIRS) supporting both content-based retrieval and structure-based retrieval, and implement it using the O2 Store storage system with the standard C language under the UNIX operating system environment. In order to make it easy to write a user query for SIRS and to obtain SGML documents that are relevant to the query, we also implement a WWW-based user interface by using CGI. Finally, we evaluate the performance of SIRS in terms of the record insertion time, deletion time, retrieval time and storage overhead.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"11 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":"115585535","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 approach for generating file interfaces","authors":"A. Ebert, U. Hohenstein, Michael Höding","doi":"10.1109/DASFAA.1999.765737","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765737","url":null,"abstract":"This paper deals with generating interfaces to files. The presented approach consists of two main parts: first, describing the file structure in an object-oriented manner, and second, manipulating the files by means of either SQL or ODMG 2.0 object manipulation and querying. The principle of the approach is centered around a powerful specification language. Using this language, the structure of file contents is specified. Given such a specification, a generator automatically installs a corresponding relational database. Moreover, an adapter is generated that parses files and transfers the unstructured data from files to the structured relational database. Afterwards, the data can be handled by means of SQL. In addition, a semantic enrichment process can be used to achieve an object-oriented view of the data and an ODMG 2.0 conforming access.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"53 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":"123193041","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}
Yusuke Yokota, Tatsuya Nakamura, H. Tarumi, Y. Kambayashi
{"title":"Multiple dynamic view support for cooperative work","authors":"Yusuke Yokota, Tatsuya Nakamura, H. Tarumi, Y. Kambayashi","doi":"10.1109/DASFAA.1999.765767","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765767","url":null,"abstract":"VIEW Media is a cooperative hypermedia system, which supports cooperative work utilizing hypermedia documents. It provides fundamental functions for cooperative work support systems and enables developers to construct various groupware such as distributed presentation systems, education systems, conference systems, and so forth. This system provides a powerful and flexible mechanism of customization. The mechanism can alter presentation, structure, behavior and authority of hypermedia documents and workspace, which supports dynamic change of roles of users. This paper describes the purpose of VIEW Media, its basic model and implementation, and a user interface which supports conferences among users who have different access rights to shared documents.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"22 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":"130098691","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}