📄 vldb_2003_elementary.txt
字号:
<proceedings><paper><title>A Nanotechnology-based Approach to Data Storage.</title><author><AuthorName>Evangelos Eleftheriou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Peter B{\"a}chtold</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Giovanni Cherubini</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ajay Dholakia</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christoph Hagleitner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>T. Loeliger</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>A. Pantazi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>H. Pozidis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>T. R. Albrecht</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gerd K. Binnig</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michel Despont</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ute Drechsler</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Urs D{\"u}rig</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>B. Gotsmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>D. Jubin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Walter H{\"a}berle</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mark A. Lantz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hugo E. Rothuizen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Richard Stutz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Peter Vettiger</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>D. Wiesmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S01P01.pdf</abstract></paper><paper><title>Integrating Information for On Demand Computing.</title><author><AuthorName>Nelson Mendon\c{c}a Mattos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S01P02.pdf</abstract></paper><paper><title>The Data-Centric Revolution in Networking.</title><author><AuthorName>Scott Shenker</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S01P03.pdf</abstract></paper><paper><title>The History of Histograms (abridged).</title><author><AuthorName>Yannis E. Ioannidis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S02P01.pdf</abstract></paper><paper><title>Complex Queries over Web Repositories.</title><author><AuthorName>Sriram Raghavan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hector Garcia-Molina</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S03P01.pdf</abstract></paper><paper><title>XSEarch: A Semantic Search Engine for XML.</title><author><AuthorName>Sara Cohen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jonathan Mamou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yaron Kanza</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yehoshua Sagiv</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S03P02.pdf</abstract></paper><paper><title>An Efficient and Resilient Approach to Filtering and Disseminating Streaming Data.</title><author><AuthorName>Shetal Shah</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shyamshankar Dharmarajan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Krithi Ramamritham</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S03P03.pdf</abstract></paper><paper><title>Efficient Mining of XML Query Patterns for Caching.</title><author><AuthorName>Liang Huai Yang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mong-Li Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wynne Hsu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S04P01.pdf</abstract></paper><paper><title>A Framework for Clustering Evolving Data Streams.</title><author><AuthorName>Charu C. Aggarwal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jiawei Han</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jianyong Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Philip S. Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S04P02.pdf</abstract></paper><paper><title>A Regression-Based Temporal Pattern Mining Scheme for Data Streams.</title><author><AuthorName>Wei-Guang Teng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ming-Syan Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Philip S. Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S04P03.pdf</abstract></paper><paper><title>On the Costs of Multilingualism in Database Systems.</title><author><AuthorName>A. Kumaran</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jayant R. Haritsa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S05P01.pdf</abstract></paper><paper><title>Distributed Top-N Query Processing with Possibly Uncooperative Local Systems.</title><author><AuthorName>Clement T. Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>George Philip</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Weiyi Meng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S05P02.pdf</abstract></paper><paper><title>Optimized Query Execution in Large Search Engines with Global Page Ordering.</title><author><AuthorName>Xiaohui Long</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Torsten Suel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S05P03.pdf</abstract></paper><paper><title>Path Queries on Compressed XML.</title><author><AuthorName>Peter Buneman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Martin Grohe</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christoph Koch</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S06P01.pdf</abstract></paper><paper><title>On the minimization of Xpath queries.</title><author><AuthorName>Sergio Flesca</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Filippo Furfaro</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Elio Masciari</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S06P02.pdf</abstract></paper><paper><title>Covering Indexes for XML Queries: Bisimulation - Simulation = Negation.</title><author><AuthorName>Prakash Ramanan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S06P03.pdf</abstract></paper><paper><title>Phrase Matching in XML.</title><author><AuthorName>Sihem Amer-Yahia</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mary F. Fern{\'a}ndez</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Divesh Srivastava</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yu Xu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S07P01.pdf</abstract></paper><paper><title>RRXF: Redundancy reducing XML storage in relations.</title><author><AuthorName>Yi Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Susan B. Davidson</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Carmem S. Hara</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yifeng Zheng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S07P02.pdf</abstract></paper><paper><title>MARS: A System for Publishing XML from Mixed and Redundant Storage.</title><author><AuthorName>Alin Deutsch</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Val Tannen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S07P03.pdf</abstract></paper><paper><title>Projecting XML Documents.</title><author><AuthorName>Am{\'e}lie Marian</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>J{\'e}r{\^o}me Sim{\'e}on</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S08P01.pdf</abstract></paper><paper><title>Mixed Mode XML Query Processing.</title><author><AuthorName>Alan Halverson</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Josef Burger</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Leonidas Galanis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ameet Kini</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rajasekar Krishnamurthy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ajith Nagaraja Rao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Feng Tian</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Stratis Viglas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yuan Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey F. Naughton</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>David J. DeWitt</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S08P02.pdf</abstract></paper><paper><title>From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery.</title><author><AuthorName>Zhimin Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>H. V. Jagadish</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Laks V. S. Lakshmanan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Stelios Paparizos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S08P03.pdf</abstract></paper><paper><title>Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach.</title><author><AuthorName>Christoph Koch</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S09P01.pdf</abstract></paper><paper><title>Query Processing for High-Volume XML Message Brokering.</title><author><AuthorName>Yanlei Diao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael J. Franklin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S09P02.pdf</abstract></paper><paper><title>Holistic Twig Joins on Indexed XML Documents.</title><author><AuthorName>Haifeng Jiang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wei Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hongjun Lu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey Xu Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S09P03.pdf</abstract></paper><paper><title>Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources.</title><author><AuthorName>Stratis Viglas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey F. Naughton</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Josef Burger</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S10P01.pdf</abstract></paper><paper><title>Scheduling for shared window joins over data streams.</title><author><AuthorName>Moustafa A. Hammad</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael J. Franklin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Walid G. Aref</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ahmed K. Elmagarmid</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S10P02.pdf</abstract></paper><paper><title>Load Shedding in a Data Stream Manager.</title><author><AuthorName>Nesime Tatbul</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ugur \c{C}etintemel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Stanley B. Zdonik</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mitch Cherniack</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael Stonebraker</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S10P03.pdf</abstract></paper><paper><title>Querying the Internet with PIER.</title><author><AuthorName>Ryan Huebsch</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Joseph M. Hellerstein</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nick Lanham</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Boon Thau Loo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Scott Shenker</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ion Stoica</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S11P01.pdf</abstract></paper><paper><title>Tuple Routing Strategies for Distributed Eddies.</title><author><AuthorName>Feng Tian</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>David J. DeWitt</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S11P02.pdf</abstract></paper><paper><title>AQuery: Query Language for Ordered Data, Optimization Techniques, and Experiments.</title><author><AuthorName>Alberto Lerner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dennis Shasha</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S11P03.pdf</abstract></paper><paper><title>WISE-Integrator: An Automatic Integrator of Web Search Interfaces for E-Commerce.</title><author><AuthorName>Hai He</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Weiyi Meng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Clement T. Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Zonghuan Wu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S12P01.pdf</abstract></paper><paper><title>SASH: A Self-Adaptive Histogram Set for Dynamically Changing Workloads.</title><author><AuthorName>Lipyeow Lim</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Min Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey Scott Vitter</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S12P02.pdf</abstract></paper><paper><title>VIPAS: Virtual Link Powered Authority Search in the Web.</title><author><AuthorName>Chi-Chun Lin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ming-Syan Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S12P03.pdf</abstract></paper><paper><title>Balancing Performance and Data Freshness in Web Database Servers.</title><author><AuthorName>Alexandros Labrinidis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nick Roussopoulos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S13P01.pdf</abstract></paper><paper><title>Buffering Accesses to Memory-Resident Index Structures.</title><author><AuthorName>Jingren Zhou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kenneth A. Ross</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S13P02.pdf</abstract></paper><paper><title>Data Morphing: An Adaptive, Cache-Conscious Storage Technique.</title><author><AuthorName>Richard A. Hankins</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jignesh M. Patel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S13P03.pdf</abstract></paper><paper><title>COMBI-Operator: Database Support for Data Mining Applications.</title><author><AuthorName>Alexander Hinneburg</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wolfgang Lehner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dirk Habich</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S14P01.pdf</abstract></paper><paper><title>A Shrinking-Based Approach for Multi-Dimensional Data Analysis.</title><author><AuthorName>Yong Shi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yuqing Song</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Aidong Zhang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S14P02.pdf</abstract></paper><paper><title>Data Bubbles for Non-Vector Data: Speeding-up Hierarchical Clustering in Arbitrary Metric Spaces.</title><author><AuthorName>Jianjun Zhou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>J{\"o}rg Sander</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S14P03.pdf</abstract></paper><paper><title>Finding Hierarchical Heavy Hitters in Data Streams.</title><author><AuthorName>Graham Cormode</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Flip Korn</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>S. Muthukrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Divesh Srivastava</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S15P01.pdf</abstract></paper><paper><title>Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration.</title><author><AuthorName>Dong Xin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jiawei Han</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Xiaolei Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Benjamin W. Wah</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S15P02.pdf</abstract></paper><paper><title>Coarse-Grained Optimization: Techniques for Rewriting SQL Statement Sequences.</title><author><AuthorName>Tobias Kraft</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Holger Schwarz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ralf Rantzau</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Bernhard Mitschang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S15P03.pdf</abstract></paper><paper><title>Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams.</title><author><AuthorName>Lukasz Golab</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>M. Tamer {\"O}zsu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S16P01.pdf</abstract></paper><paper><title>Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates.</title><author><AuthorName>Glenn S. Iwerks</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hanan Samet</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kenneth P. Smith</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S16P02.pdf</abstract></paper><paper><title>Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps.</title><author><AuthorName>Torsten Grust</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Maurice van Keulen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jens Teubner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S16P03.pdf</abstract></paper><paper><title>Checks and Balances: Monitoring Data Quality Problems in Network Traffic Databases.</title><author><AuthorName>Flip Korn</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>S. Muthukrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yunyue Zhu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S17P01.pdf</abstract></paper><paper><title>Systematic Development of Data Mining-Based Data Quality Tools.</title><author><AuthorName>Dominik L{\"u}bbers</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Udo Grimmer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Matthias Jarke</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S17P02.pdf</abstract></paper><paper><title>Adaptive, Hands-Off Stream Mining.</title><author><AuthorName>Spiros Papadimitriou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anthony Brockwell</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christos Faloutsos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S17P03.pdf</abstract></paper><paper><title>Composing Mappings Among Data Sources.</title><author><AuthorName>Jayant Madhavan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alon Y. Halevy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S18P01.pdf</abstract></paper><paper><title>Mapping Adaptation under Evolving Schemas.</title><author><AuthorName>Yannis Velegrakis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ren{\'e}e J. Miller</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Lucian Popa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S18P02.pdf</abstract></paper><paper><title>Locking Protocols for Materialized Aggregate Join Views.</title><author><AuthorName>Gang Luo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey F. Naughton</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Curt Ellmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael Watzke</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S18P03.pdf</abstract></paper><paper><title>Supporting Frequent Updates in R-Trees: A Bottom-Up Approach.</title><author><AuthorName>Mong-Li Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wynne Hsu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christian S. Jensen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Bin Cui</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Keng Lik Teo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S19P01.pdf</abstract></paper><paper><title>The ND-Tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces.</title><author><AuthorName>Gang Qian</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Qiang Zhu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Qiang Xue</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sakti Pramanik</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S19P02.pdf</abstract></paper><paper><title>Temporal Slicing in the Evaluation of XML Queries.</title><author><AuthorName>Dengfeng Gao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Richard T. Snodgrass</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S19P03.pdf</abstract></paper><paper><title>The Generalized Pre-Grouping Transformation: Aggregate-Query Optimization in the Presence of Dependencies.</title><author><AuthorName>Aris Tsois</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Timos K. Sellis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S20P01.pdf</abstract></paper><paper><title>Estimating the Output Cardinality of Partial Preaggregation with a Measure of Clusteredness.</title><author><AuthorName>Sven Helmer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Thomas Neumann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Guido Moerkotte</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S20P02.pdf</abstract></paper><paper><title>BHUNT: Automatic Discovery of Fuzzy Algebraic Constraints in Relational Data.</title><author><AuthorName>Paul Brown</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Peter J. Haas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S20P03.pdf</abstract></paper><paper><title>Tabular Placement of Relational Data on MEMS-based Storage Devices.</title><author><AuthorName>Hailing Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Divyakant Agrawal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Amr El Abbadi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S21P01.pdf</abstract></paper><paper><title>Memory Requirements for Query Execution in Highly Constrained Devices.</title><author><AuthorName>Nicolas Anciaux</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Luc Bouganim</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Philippe Pucheral</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S21P02.pdf</abstract></paper><paper><title>Lachesis: Robust Database Storage Management Based on Device-specific Performance Characteristics.</title><author><AuthorName>Jiri Schindler</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anastassia Ailamaki</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gregory R. Ganger</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S21P03.pdf</abstract></paper><paper><title>Cache Tables: Paving the Way for an Adaptive Database Cache.</title><author><AuthorName>Mehmet Altinel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christof Bornh{\"o}vd</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sailesh Krishnamurthy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>C. Mohan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hamid Pirahesh</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Berthold Reinwald</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S22P01.pdf</abstract></paper><paper><title>Primitives for Workload Summarization and Implications for SQL.</title><author><AuthorName>Surajit Chaudhuri</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Prasanna Ganesan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Vivek R. Narasayya</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S22P02.pdf</abstract></paper><paper><title>A Dependability Benchmark for OLTP Application Environments.</title><author><AuthorName>Marco Vieira</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Henrique Madeira</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S22P03.pdf</abstract></paper><paper><title>Supporting Top-k Join Queries in Relational Databases.</title><author><AuthorName>Ihab F. Ilyas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Walid G. Aref</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ahmed K. Elmagarmid</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S23P01.pdf</abstract></paper><paper><title>AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions.</title><author><AuthorName>Arvind Hulgeri</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>S. Sudarshan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S23P02.pdf</abstract></paper><paper><title>Efficient Approximation Of Optimization Queries Under Parametric Aggregation Constraints.</title><author><AuthorName>Sudipto Guha</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dimitrios Gunopulos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nick Koudas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Divesh Srivastava</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michail Vlachos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S23P03.pdf</abstract></paper><paper><title>The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries.</title><author><AuthorName>Yufei Tao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dimitris Papadias</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jimeng Sun</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S24P01.pdf</abstract></paper><paper><title>Query Processing in Spatial Network Databases.</title><author><AuthorName>Dimitris Papadias</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jun Zhang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nikos Mamoulis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yufei Tao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S24P02.pdf</abstract></paper><paper><title>Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets.</title><author><AuthorName>Xuemin Lin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Qing Liu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yidong Yuan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Xiaofang Zhou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S24P03.pdf</abstract></paper><paper><title>Avoiding Ordering and Grouping In Query Processing.</title><author><AuthorName>Xiaoyu Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mitch Cherniack</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S25P01.pdf</abstract></paper><paper><title>Operator Scheduling in a Data Stream Manager.</title><author><AuthorName>Donald Carney</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ugur \c{C}etintemel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alex Rasin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Stanley B. Zdonik</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mitch Cherniack</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael Stonebraker</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S25P02.pdf</abstract></paper><paper><title>Efficient IR-Style Keyword Search over Relational Databases.</title><author><AuthorName>Vagelis Hristidis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Luis Gravano</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yannis Papakonstantinou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S25P03.pdf</abstract></paper><paper><title>Merging Models Based on Given Correspondences.</title><author><AuthorName>Rachel Pottinger</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Philip A. Bernstein</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S26P01.pdf</abstract></paper><paper><title>Locating Data Sources in Large Distributed Systems.</title><author><AuthorName>Leonidas Galanis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yuan Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shawn R. Jeffery</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>David J. DeWitt</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S26P02.pdf</abstract></paper><paper><title>Robust Estimation With Sampling and Approximate Pre-Aggregation.</title><author><AuthorName>Chris Jermaine</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S26P03.pdf</abstract></paper><paper><title>Controlling Access to Published Data Using Cryptography.</title><author><AuthorName>Gerome Miklau</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dan Suciu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S27P01.pdf</abstract></paper><paper><title>OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences.</title><author><AuthorName>Colin Meek</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jignesh M. Patel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shruti Kasetty</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S27P02.pdf</abstract></paper><paper><title>Privacy-Preserving Indexing of Documents on the Network.</title><author><AuthorName>Mayank Bawa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Roberto J. Bayardo Jr.</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rakesh Agrawal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S27P03.pdf</abstract></paper><paper><title>Data Compression in Oracle.</title><author><AuthorName>Meikel P{\"o}ss</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dmitry Potapov</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S28P01.pdf</abstract></paper><paper><title>Improving Performance with Bulk-Inserts in Oracle R-Trees.</title><author><AuthorName>Ning An</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kothuri Venkata Ravi Kanth</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Siva Ravada</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S28P02.pdf</abstract></paper><paper><title>Statistics on Views.</title><author><AuthorName>C{\'e}sar A. Galindo-Legaria</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Milind Joshi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Florian Waas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ming-Chuan Wu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S28P03.pdf</abstract></paper><paper><title>Efficient Query Processing for Multi-Dimensionally Clustered Tables in DB2.</title><author><AuthorName>Bishwaranjan Bhattacharjee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sriram Padmanabhan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Timothy Malkemus</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Tony Lai</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Leslie Cranston</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Matthew Huras</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S29P01.pdf</abstract></paper><paper><title>A Platform Based on the Multi-dimensional Data Model for Analysis of Bio-Molecular Structures.</title><author><AuthorName>Srinath Srinivasa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sujit Kumar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S29P02.pdf</abstract></paper><paper><title>Capturing Global Transactions from Multiple Recovery Log Files in a Partitioned Database System.</title><author><AuthorName>Chengfei Liu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Bruce G. Lindsay</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Serge Bourbonnais</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Elizabeth Hamel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Tuong C. Truong</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jens Stankiewitz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S29P03.pdf</abstract></paper><paper><title>The BEA/XQRL Streaming XQuery Processor.</title><author><AuthorName>Daniela Florescu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chris Hillery</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Donald Kossmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Paul Lucas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Fabio Riccardi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Till Westmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael J. Carey</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Arvind Sundararajan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Geetika Agrawal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S30P01.pdf</abstract></paper><paper><title>XML Schemas in Oracle XML DB.</title><author><AuthorName>Ravi Murthy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sandeepan Banerjee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S30P02.pdf</abstract></paper><paper><title>Integrated Data Management for Mobile Services in the Real World.</title><author><AuthorName>Christian Hage</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christian S. Jensen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Torben Bach Pedersen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Laurynas Speicys</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Igor Timko</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S30P03.pdf</abstract></paper><paper><title>Web Services (Industrial Session).</title><author><AuthorName>Felipe Cabrera</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S31P01.pdf</abstract></paper><paper><title>Grid and Applications (Industrial Session).</title><author><AuthorName>Frank Leymann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S32P01.pdf</abstract></paper><paper><title>Commercial Use of Database Technology.</title><author><AuthorName>Harald Sch{\"o}ning</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S33P01.pdf</abstract></paper><paper><title>The Zero-Delay Data Warehouse: Mobilizing Heterogeneous Databases.</title><author><AuthorName>eva K{\"u}hn</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S33P02.pdf</abstract></paper><paper><title>A Database Striptease or How to Manage Your Personal Databases.</title><author><AuthorName>Martin L. Kersten</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gerhard Weikum</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael J. Franklin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Daniel A. Keim</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alejandro P. Buchmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Surajit Chaudhuri</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S34P01.pdf</abstract></paper><paper><title>Who needs XML Databases?</title><author><AuthorName>Sophie Cluet</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2003</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2003/papers/S34P02.pdf</abstract></paper><paper><title>Illuminating the Dark Side of Web Services.</title><author><AuthorName>Michael L. Brodie</AuthorName><institute><InstituteName></InstituteName><countr⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -