Proceedings. 20th International Conference on Data Engineering最新文献_第4页

Outrageous ideas and/or thoughts while shaving 剃须时的荒唐想法和/或想法

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320096

M. Stonebraker

引用次数: 2

Modeling uncertainties in publish/subscribe systems 发布/订阅系统中的不确定性建模

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320023

Haifeng Liu, H. Jacobsen

引用次数: 60

Benchmarking SAP R/3 archiving scenarios 对SAP R/3归档场景进行基准测试

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320046

Bernhard Zeller, A. Kemper

{"title":"Benchmarking SAP R/3 archiving scenarios","authors":"Bernhard Zeller, A. Kemper","doi":"10.1109/ICDE.2004.1320046","DOIUrl":"https://doi.org/10.1109/ICDE.2004.1320046","url":null,"abstract":"According to a survey of the University of Berkeley [P. Lyman et al., (2003)], about 5 Exabytes of new information has been created in 2002. This information explosion affects also the database volumes of enterprise resource planning (ERP) systems like SAP R/3, the market leader for ERP systems. Just like the overall information explosion, the database volumes of ERP systems are growing at a tremendous rate and some of them have reached a size of several Terabytes. OLTP (online transaction processing) databases of this size are hard to maintain and tend to perform poorly. One way to limit the size of a database is data staging, i.e., to make use of an SAP technique called archiving. That is, data which are not needed for every-day operations are demoted from the database (disks) to tertiary storage (tapes). In cooperation with our research group, SAP is adapting their archiving techniques to accelerate the archiving process by integrating new technologies like XML and advanced database features. However, so far no benchmark existed to evaluate different archiving scenarios and to measure the impact of a change in the archiving technique. We therefore designed and implemented a generic benchmark which is applicable to many different system layouts and allows the users to evaluate various archiving scenarios.","PeriodicalId":358862,"journal":{"name":"Proceedings. 20th International Conference on Data Engineering","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115469387","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}

引用次数: 3

EShopMonitor: a Web content monitoring tool EShopMonitor: Web内容监控工具

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320055

N. Agrawal, Rema Ananthanarayanan, Rahul Gupta, Sachindra Joshi, R. Krishnapuram, Sumit Negi

引用次数: 5

Load shedding for aggregation queries over data streams 数据流上聚合查询的负载减少

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320010

Brian Babcock, Mayur Datar, R. Motwani

引用次数: 374

Minimization and group-by detection for nested XQueries 对嵌套的xquery进行最小化和分组检测

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320069

Alin Deutsch, Y. Papakonstantinou, Yu Xu

引用次数: 8

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320066

K. Murthy, H. Kriegel, Stefan Schönauer, T. Seidl

引用次数: 3

SPINE: putting backbone into string indexing SPINE:将主干放入字符串索引中

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320008

Naresh Neelapala, Romil Mittal, J. Haritsa

{"title":"SPINE: putting backbone into string indexing","authors":"Naresh Neelapala, Romil Mittal, J. Haritsa","doi":"10.1109/ICDE.2004.1320008","DOIUrl":"https://doi.org/10.1109/ICDE.2004.1320008","url":null,"abstract":"The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. We investigate an alternative approach to index building, based on horizontal (inter-path) compaction of the trie. In particular, we present SPINE, a carefully engineered horizontally-compacted trie index. SPINE consists of a backbone formed by a linear chain of nodes representing the underlying string, with the nodes connected by a rich set of edges for facilitating fast forward and backward traversals over the backbone during index construction and query search. A special feature of SPINE is that it collapses the trie into a linear structure, representing the logical extreme of horizontal compaction. We describe algorithms for SPINE construction and for searching this index to find the occurrences of query patterns. Our experimental results on a variety of real genomic and proteomic strings show that SPINE requires significantly less space than standard implementations of suffix trees. Further, SPINE takes lesser time for both construction and search as compared to suffix trees, especially when the index is disk-resident. Finally, the linearity of its structure makes it more amenable for integration with database engines.","PeriodicalId":358862,"journal":{"name":"Proceedings. 20th International Conference on Data Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131349950","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}

引用次数: 7

"My personal web": a seminar on personalization and privacy for web and converged services “我的个人网络”:一个关于网络和融合服务的个性化和隐私的研讨会

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320098

I. Fundulaki, R. Hull, B. Kumar, D. Lieuwen, Arnaud Sahuguet

{"title":"\"My personal web\": a seminar on personalization and privacy for web and converged services","authors":"I. Fundulaki, R. Hull, B. Kumar, D. Lieuwen, Arnaud Sahuguet","doi":"10.1109/ICDE.2004.1320098","DOIUrl":"https://doi.org/10.1109/ICDE.2004.1320098","url":null,"abstract":"The web services paradigm holds the promise of tremendous flexibility in how services are combined to meet the needs of individual end-users. The “convergence” of networks (wireline telephony, wireless, data) further enhances the web services paradigm, by enabling the incorporation of real time contextual information (e.g., presence and location) along with opportunities for web services to impact the physical world more immediately (e.g., a vending machine delivering a soda based on a purchase via a cell phone). But it will not be possible for most end-users to enjoy the rich and intricate possibilities, unless a broad variety of personalization technologies are available and respect the end user’s legitimate need for privacy. This seminar begins with examples illustrating why personalization will be so important for the emerging web and converged services. The main body of the seminar focuses on 3 inter-related technologies. First is profile data management, the ability for services to share and access end-user profile data (including address, credit card, “simple” preferences, current location, current presence, ...) as appropriate for the services to be provided. Second is preference and policy management, the ability to store and execute on intricate, interrelated preferences that end-users may have (e.g., “during working hours, calls from strangers should be routed to voice-mail”; “I usually work from 9 to 6, but on Thursdays it is from 8 to 4”; ...). And third is personalized and privacy-conscious data sharing of profile data and preferences, the notion that an end-user should have complete control over what profile and preference data is shared with whom and under what circumstances and how it is interpreted. In addition to describing emerging approaches for providing these capabilities, the seminar will describe how to add value to applications by using personalization, from both the end-user and the application provider perspectives.","PeriodicalId":358862,"journal":{"name":"Proceedings. 20th International Conference on Data Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124637516","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}

引用次数: 0

Efficient execution of computation modules in a model with massive data 在具有海量数据的模型中高效执行计算模块

Proceedings. 20th International Conference on Data Engineering Pub Date : 2004-03-30 DOI: 10.1109/ICDE.2004.1320071

Gary Kratkiewicz, R. Bostwick, Geoffrey S. Knauth

引用次数: 0