{"title":"Managing distributed memory to meet multiclass workload response time goals","authors":"Markus Sinnwell, A. König","doi":"10.1109/ICDE.1999.754903","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754903","url":null,"abstract":"In this paper we present an online method for managing a goal-oriented buffer partitioning in the distributed memory of a network of workstations. Our algorithm implements a feedback mechanism which dynamically changes the sizes of dedicated buffer areas and thereby the buffer hit rate for the different classes in such a way that user-specified response time goals are satisfied. The aggregated size of the buffer memory across all network nodes remains constant and only the partitioning is changed. The algorithm is based on efficiently approximating the trajectory of the per-class response time curves as a function of the available buffer. Changes in the workload that would lead to violation of response time goals are counteracted by accordingly adjusting the buffer allocation. For local replacement decisions, we integrate a cost-based buffer replacement algorithm to fit into our goal-oriented approach. We have implemented our algorithm in a detailed simulation prototype and we present first results obtained from this prototype.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116243457","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":"Exploiting data lineage for parallel optimization in extensible DBMSs","authors":"E. C. Shek, R. Muntz","doi":"10.1109/ICDE.1999.754936","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754936","url":null,"abstract":"Extensibility and high query performance are important requirements of advanced large scale information systems since complex data analysis often requires the use of application-specific operations that have to be introduced by the user issuing the query. Towards the goal of supporting automatic parallelization of queries containing complex user-defined evaluators in an extensible DBMS, we devised a relevance window model to capture the inherent data lineage characteristics of evaluators on multidimensional data sets. Informally, the relevance window of an evaluator defines the scope of influence input data records have on the value of records in the output data space. An evaluator's relevance window constrains the data partitioning opportunities available for an evaluator.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128155917","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 bulk index join: a generic approach to processing non-equijoins","authors":"Jochen Van den Bercken, B. Seeger, P. Widmayer","doi":"10.1109/ICDE.1999.754937","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754937","url":null,"abstract":"Presents a new algorithm called the 'bulk index join' that can be applied to a broad class of non-equijoins. Similar to the well-known index nested-loops join algorithm, the bulk index join probes the records of the outer relation against the inner relation by using a pre-existing index structure. Like the index nested-loops join, our algorithm is generic in that any tree-based index structure supporting the join predicate can be used. Moreover, the designer of a new index structure might use our generic code to extend the functionality of the index structure without any additional effort. Our experience indicates that the bulk index join is a generic algorithm that performs very fast, and that its implementation is simple enough to be of immediate practical value.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130827500","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":"Query processing issues in image (multimedia) databases","authors":"S. Nepal, M. Ramakrishna","doi":"10.1109/ICDE.1999.754894","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754894","url":null,"abstract":"Multimedia database systems are essential for the effective and efficient use of large collections of image data. The aim of such systems is to enable retrieval of images based on their contents. As part of our research in this area, we are building a prototype content-based image retrieval system called CHITRA. This uses a four-level data model, and we have defined a fuzzy object query language (FOQL) for this system. This system enables retrieval based on high-level concepts, such as \"retrieve images of mountains and sunset\". A problem faced in this system is the processing of complex queries such as \"retrieve all images that have a similar color histogram and a similar texture to the given example image\". Such problems have attracted research attention in recent times. R. Fagin (1996) has given an algorithm for processing such queries and provided a probabilistic upper bound for the complexity of the algorithm (which has been implemented in IBM's Garlic project). In this paper, we provide a theoretical (probabilistic) analysis of the expected cost of this algorithm. We propose a new multi-step query processing algorithm and prove that it performs better than Fagin's algorithm in all cases. Our algorithm requires fewer database accesses. We have evaluated both algorithms against an image database of 1000 images on our CHITRA system. We have used both color histogram and Gabor texture features. Our analysis is presented and the reported experimental results validate our algorithm (which has a significant performance improvement).","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123341660","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":"Policies in a resource manager of workflow systems: modeling, enforcement and management","authors":"Yan-Nong Huang, M. Shan","doi":"10.1109/ICDE.1999.754911","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754911","url":null,"abstract":"Summary form only given. We are interested in Workflow Management Systems (WFMS), and particularly, in Resource Management (RM) of WFMS. A WFMS consists of coordinating executions of multiple activities, instructing who (resource) do what (activity) and when. The \"when\" part is taken care of by the workflow engine which orders the executions of activities based on a process definition. The \"who\" part is handled by the resource manager that aims at finding suitable resources at the run-time for the accomplishment of an activity as the engine steps through the process definition. Resources of different kinds (human and material, for example) constitute the information system of our interest, their management consists of resource modeling and effective allocation upon users' requests. Since resource allocation needs to follow certain general guidelines (authority, security, for example)-no matter who or what application issues requests: so those general guidelines are better considered as part of the resources' semantics. That is the reason why we are interested in resource policy management in RM. Resource policies are general guidelines every individual resource allocation must observe. They differ from process specific policies which are only applied to a particular process. The policy manager is a module within the resource manager, responsible for efficiently managing a (potentially large) set of policies and enforcing them in resource allocation. We propose to enforce policies by query rewriting.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132367301","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":"Efficient theme and non-trivial repeating pattern discovering in music databases","authors":"Chih-Chin Liu, Jia-Lien Hsu, Arbee L. P. Chen","doi":"10.1109/ICDE.1999.754893","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754893","url":null,"abstract":"Proposes an approach for the fast discovery of all non-trivial repeating patterns in music objects. A repeating pattern is a sequence of notes which appears more than once in a music object. The longest repeating patterns in music objects are typically their themes. The themes and other non-trivial repeating patterns are important musical features which can be used both for content-based retrieval of music data and for music data analysis. We present a data structure called an RP-tree (repeating pattern tree) and its associated algorithms for the fast extraction of all non-trivial repeating patterns in a music object. Experiments are performed to compare this method with related approaches. The results are further analysed to show the efficiency and effectiveness of our approach.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116668484","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":"Business objects and application integration","authors":"S. Zeldin","doi":"10.1109/ICDE.1999.754900","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754900","url":null,"abstract":"Summary form only given as follows. Application integration addresses the need for diverse applications to be able to communicate with each other across application boundaries and across platform boundaries. Business objects extend the type system of relational databases to deal with the needs of application integration. The requirements of business application integration include event-based information workflow to manage the exchange of data, well-formed business objects to reduce the number of application interfaces and to keep the semantic integrity of the information exchange intact, seamless transformation to integrate the validation and construction of interfacing business objects, and heterogeneous transport adapters to move business objects from one place to another. The objective of this paper is to examine the requirements for business objects and their role in application integration and to show examples of how the Mercator product addresses these requirements.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126131242","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 hypertext database for advanced sharing of distributed web pages","authors":"T. Yamakita, T. Fuji","doi":"10.1109/ICDE.1999.754907","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754907","url":null,"abstract":"There are many learning systems using their web pages. These systems provide not only contents of the web pages but also the embedded links on them for learners. In these systems, since the learners can use all the hyperlinks embedded on the web page, they can visit unnecessary/invalid web pages for learning. In order to use web pages as instructional materials, authors of instructional materials need to be able to select appropriate web pages. Moreover, it is necessary to provide only the hyperlinks among these selected pages. We propose a \"hyperlink view\". This notion means the network of these selected web pages and hyperlinks. We regard this style of reusing web pages based on the hyperlink view as the advanced sharing of them. We manage the information of many hyperlink views in the hypertext database.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129944536","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":"Cooperative caching in append-only databases with hot spots","authors":"Aman Sinha, C. Chase, M. Cochinwala","doi":"10.1109/ICDE.1999.754901","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754901","url":null,"abstract":"We measure the performance of several cooperative caching policies for a database with hot spots. The workload consists of queries and append-only update transactions, and is modeled after a financial database of stock (historical) trading information. We show that cooperative caching is effective for this application. We show that selecting the correct set of peer servers when servicing a cache miss is crucial to achieving high performance, and we demonstrate a greedy algorithm that performs close to optimal for this workload. We also evaluate several cache replacement policies and show that a 2nd-chance algorithm performs best. In a 2nd-chance algorithm, replaced pages are transferred to a peer server rather than being discarded. When a page is selected for replacement a 2nd time, the page is discarded. Our results can be applied in the design of proxy servers for databases or Web servers where a layer of proxy servers are used to scale the system performance.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"35 24","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120931099","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 warehouse maintenance under concurrent schema and data updates","authors":"Xin Zhang, Elke A. Rundensteiner","doi":"10.1109/ICDE.1999.754933","DOIUrl":"https://doi.org/10.1109/ICDE.1999.754933","url":null,"abstract":"Summary form only given. Data warehouses (DW) are built by gathering information from several information sources (IS) and integrating it into one repository customized to users' needs. ISs are typically owned by different information providers and hence are independent and autonomous. This implies they will update their data and schemas independently and without any concern for how this may affect the DW defined upon them. Hence, solutions for data warehouse maintenance are needed that can handle such IS updates. We have developed a first comprehensive solution that successfully tackles this problem (X. Zhang et al., 1998). In particular, to guarantee the correctness of concurrent view definition evolution and view extent maintenance of a data warehouse, we introduce a framework called the SDCC (Schema change and Data update Concurrency Control) system. SDCC integrates various algorithms designed to address different individual view maintenance subproblems into one system, such as algorithms for view extent maintenance after IS data updates, for view definition evolution after IS schema changes, and for view extent adaptation after view definition changes.","PeriodicalId":236128,"journal":{"name":"Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125257929","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}