Nicolas Bruno, L. Gravano, Nick Koudas, D. Srivastava
{"title":"Navigation- vs. index-based XML multi-query processing","authors":"Nicolas Bruno, L. Gravano, Nick Koudas, D. Srivastava","doi":"10.1109/ICDE.2003.1260788","DOIUrl":"https://doi.org/10.1109/ICDE.2003.1260788","url":null,"abstract":"XML path queries form the basis of complex filtering of XML data. Most current XML path query processing techniques can be divided in two groups. Navigation-based algorithms compute results by analyzing an input document one tag at a time. In contrast, index-based algorithms take advantage of precomputed numbering schemes over the input XML document. We introduce a new index-based technique, index-filter, to answer multiple XML path queries. Index-filter uses indexes built over the document tags to avoid processing large portions of the input document that are guaranteed not to be part of any match. We analyze index-filter and compare it against Y-filter, a state-of-the-art navigation-based technique. We show that both techniques have their advantages, and we discuss the scenarios under which each technique is superior to the other one. In particular, we show that while most XML path query processing techniques work off SAX events, in some cases it pays off to preprocess the input document, augmenting it with auxiliary information that can be used to evaluate the queries faster. We present experimental results over real and synthetic XML documents that validate our claims.","PeriodicalId":175485,"journal":{"name":"Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115370543","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}
Panayiotis Tsaparas, Themis Palpanas, Y. Kotidis, Nick Koudas, D. Srivastava
{"title":"Ranked join indices","authors":"Panayiotis Tsaparas, Themis Palpanas, Y. Kotidis, Nick Koudas, D. Srivastava","doi":"10.1109/ICDE.2003.1260799","DOIUrl":"https://doi.org/10.1109/ICDE.2003.1260799","url":null,"abstract":"A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ranking of the entities according to the values in the attribute domain. Commonly, users correlate such sources for query processing purposes through join operations. In query processing, it is desirable to incorporate user preferences towards specific attributes or their values. A way to incorporate such preferences is by utilizing scoring functions that combine user preferences and attribute values and return a numerical score for each tuple in the join result. Then, a target query, which we refer to as top-k join query, seeks to identify the k tuples in the join result with the highest scores. We propose a novel technique, which we refer to as ranked join index, to efficiently answer top-k join queries for arbitrary, user specified, preferences and a large class of scoring functions. Our rank join index requires small space (compared to the entire join result) and provides guarantees for its performance. Moreover, our proposal provides a graceful tradeoff between its space requirements and worst case search performance. We supplement our analytical results with a thorough experimental evaluation using a variety of real and synthetic data sets, demonstrating that, in comparison to other viable approaches, our technique offers significant performance benefits.","PeriodicalId":175485,"journal":{"name":"Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121109916","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}
S. C. Sahinalp, M. Tasan, J. Macker, Z. M. Özsoyoglu
{"title":"Distance based indexing for string proximity search","authors":"S. C. Sahinalp, M. Tasan, J. Macker, Z. M. Özsoyoglu","doi":"10.1109/ICDE.2003.1260787","DOIUrl":"https://doi.org/10.1109/ICDE.2003.1260787","url":null,"abstract":"In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries (asking for strings that are most similar to a query string). The similarity between strings is defined in terms of a distance function determined by the application domain. The most popular string distance measures are based on (a weighted) count of (i) character edit or (ii) block edit operations to transform one string into the other. Examples include the Levenshtein edit distance and the recently introduced compression distance. The main goal is to develop efficient near(est) neighbor search tools that work for both character and block edit distances. Our premise is that distance-based indexing methods, which are originally designed for metric distances can be modified for string distance measures, provided that they form almost metrics. We show that several distance measures, such as the compression distance and weighted character edit distance are almost metrics. In order to analyze the performance of distance based indexing methods (in particular VP trees) for strings, we then develop a model based on distribution of pairwise distances. Based on this model we show how to modify VP trees to improve their performance on string data, providing tradeoffs between search time and space. We test our theoretical results on synthetic data sets and protein strings.","PeriodicalId":175485,"journal":{"name":"Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127513492","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}
J. Chomicki, P. Godfrey, Jarek Gryz, Dongmin Liang
{"title":"Skyline with presorting","authors":"J. Chomicki, P. Godfrey, Jarek Gryz, Dongmin Liang","doi":"10.1109/ICDE.2003.1260846","DOIUrl":"https://doi.org/10.1109/ICDE.2003.1260846","url":null,"abstract":"The skyline, or Pareto, operator selects those tuples that are not dominated by any others. Extending relational systems with the skyline operator would offer a basis for handling preference queries. Good algorithms are needed for skyline, however, to make this efficient in a relational setting. We propose a skyline algorithm, SFS, based on presorting that is general, for use with any skyline query, efficient, and well behaved in a relational setting.","PeriodicalId":175485,"journal":{"name":"Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123702638","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":"PIX: a system for phrase matching in XML documents: a demonstration","authors":"S. Amer-Yahia, M. Fernández, D. Srivastava, Yu Xu","doi":"10.1109/ICDE.2003.1260864","DOIUrl":"https://doi.org/10.1109/ICDE.2003.1260864","url":null,"abstract":"We present a system that enables flexible and efficient phrase matching in XML documents. Since XML allows structured and unstructured information to be interleaved, phrase matching in XML raises new challenges. Our system, named PIX, permits phrase matching in XML documents that contain “mixed content”. A key feature of PIX is that users can specify which element and content to ignore when matching a phrase. PIX uses inverted indices and an efficient evaluation algorithm to compute the set of matches and returns answers where phrases, ignored tags and content are highlighted. In addition, query answers are sorted using a ranking function. PIX is implemented as an extension of GALAX, a full-fledged XQuery engine. The functionality of PIX is fully integrated into XQuery and permits a natural combination of XPath-based structure matching with phrase matching.","PeriodicalId":175485,"journal":{"name":"Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125444484","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":"Energy efficient index for querying location-dependent data in mobile broadcast environments","authors":"Jianliang Xu, Baihua Zheng, Wang-Chien Lee, Lee","doi":"10.1109/ICDE.2003.1260796","DOIUrl":"https://doi.org/10.1109/ICDE.2003.1260796","url":null,"abstract":"We are witnessing in recent years growing interest for location-dependent information services among mobile users. We examine the issue of processing location-dependent queries in a mobile broadcast environment. Different from a traditional environment, mobile users are concerned with not only access latencies but also power conservation. The planar point location algorithms and conventional spatial index structures are shown inefficient. We propose a new index data structure, called D-tree, for querying location-dependent data in mobile broadcast environments. The basic idea is to index data regions based on the divisions between them. We describe how to construct the binary D-tree index, how to process location-dependent queries based on this index structure, and how to page the D-tree to fit the packet capacity. The performance of the D-tree is evaluated using both synthetic and real datasets. Experimental results show that the proposed D-tree provides a much better overall performance than the well-known existing schemes such as the R*-tree.","PeriodicalId":175485,"journal":{"name":"Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129111243","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":"QRS: a robust numbering scheme for XML documents","authors":"T. Amagasa, Masatoshi Yoshikawa, Shunsuke Uemura","doi":"10.1109/ICDE.2003.1260842","DOIUrl":"https://doi.org/10.1109/ICDE.2003.1260842","url":null,"abstract":"Update management of XML documents is an increasingly important research issue in XML databases, because contents of XML documents evolve as time goes by. Even though, XML databases should be able to effectively process XML queries as well as updates on the documents. We propose a robust node-numbering scheme for XML documents named QRS (quartering-regions scheme). In QRS, reefs (regions expressed by floating-point numbers), a variant of regions, are used for expressing node-numbers. Reefs are almost compatible to regions, and thus they can be used for detecting ancestor-descendant relationship among nodes for the purpose of efficient query processing. Moreover, reefs can cope with updates by utilizing gaps between reefs in terms of floating-point numbers. Consequently, we can avoid node renumbering as much as possible.","PeriodicalId":175485,"journal":{"name":"Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)","volume":"660 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123978680","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":"XR-tree: indexing XML data for efficient structural joins","authors":"H. Jiang, Hongjun Lu, Wei Wang, B. Ooi","doi":"10.1109/ICDE.2003.1260797","DOIUrl":"https://doi.org/10.1109/ICDE.2003.1260797","url":null,"abstract":"XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating structural relationship, specifically parent-child or ancestor-descendant relationship, between XML element sets has imposed a great challenge on efficient XML query processing. We propose XR-tree, namely, XML region tree, which is a dynamic external memory index structure specially designed for strictly nested XML data. The unique feature of XR-tree is that, for a given element, all its ancestors (or descendants) in an element set indexed by an XR-tree can be identified with optimal worst case I/O cost. We then propose a new structural join algorithm that can evaluate the structural relationship between two XR-tree indexed element sets by effectively skipping ancestors and descendants that do not participate in the join. Our extensive performance study shows that the XR-tree based join algorithm significantly outperforms previous algorithms.","PeriodicalId":175485,"journal":{"name":"Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)","volume":"81 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116344616","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}
Anastasios Kementsietsidis, M. Arenas, Renée J. Miller
{"title":"Managing data mappings in the Hyperion project","authors":"Anastasios Kementsietsidis, M. Arenas, Renée J. Miller","doi":"10.1109/ICDE.2003.1260851","DOIUrl":"https://doi.org/10.1109/ICDE.2003.1260851","url":null,"abstract":"We consider the problem of mapping data in peer-to-peer systems. Such systems rely on simple value searches to locate data of interest. However, different peers may use different values to identify or describe the same data. To accommodate this, peer-to-peer systems often rely on mapping tables that list pairs of corresponding values for search domains that are used in different peers. We illustrate how such tables are used in the genomics community by expert curators. We then argue why mapping tables are appropriate for data mapping in a peer-to-peer environment and motivate the problem of managing these tables. The work presented is part of the Hyperion project.","PeriodicalId":175485,"journal":{"name":"Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126228347","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":"Streaming XPath queries in XSQ: a demonstration","authors":"Feng Peng, S. Chawathe","doi":"10.1109/ICDE.2003.1260866","DOIUrl":"https://doi.org/10.1109/ICDE.2003.1260866","url":null,"abstract":"","PeriodicalId":175485,"journal":{"name":"Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126460492","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}