📄 vldb_2005_elementary.txt
字号:
<proceedings><paper><title>Why Search Engines are Used Increasingly to Offload Queries from Databases.</title><author><AuthorName>Bj{\o}rn Olstad</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p1-olstad.pdf</abstract></paper><paper><title>Database-Inspired Search.</title><author><AuthorName>David Konopnicki</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Oded Shmueli</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p2-konopnicki.pdf</abstract></paper><paper><title>Sketching Streams Through the Net: Distributed Approximate Query Tracking.</title><author><AuthorName>Graham Cormode</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Minos N. Garofalakis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p13-cormode.pdf</abstract></paper><paper><title>Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling.</title><author><AuthorName>Graham Cormode</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>S. Muthukrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Irina Rozenbaum</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p25-cormode.pdf</abstract></paper><paper><title>Adaptive Stream Filters for Entity-based Queries with Non-Value Tolerance.</title><author><AuthorName>Reynold Cheng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ben Kao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sunil Prabhakar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alan Kwan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yi-Cheng Tu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p37-cheng.pdf</abstract></paper><paper><title>Improving Database Performance on Simultaneous Multithreading Processors.</title><author><AuthorName>Jingren Zhou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>John Cieslewicz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kenneth A. Ross</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mihir Shah</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p49-zhou.pdf</abstract></paper><paper><title>Parallel Querying with Non-Dedicated Computers.</title><author><AuthorName>Vijayshankar Raman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wei Han</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Inderpal Narang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p61-raman.pdf</abstract></paper><paper><title>Optimistic Intra-Transaction Parallelism on Chip Multiprocessors.</title><author><AuthorName>Christopher B. Colohan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anastassia Ailamaki</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>J. Gregory Steffan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Todd C. Mowry</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p73-colohan.pdf</abstract></paper><paper><title>Information Preserving XML Schema Embedding.</title><author><AuthorName>Philip Bohannon</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wenfei Fan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael Flaster</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>P. P. S. Narayan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p85-bohannon.pdf</abstract></paper><paper><title>Light-weight Domain-based Form Assistant: Querying Web Databases On the Fly.</title><author><AuthorName>Zhen Zhang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Bin He</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kevin Chen-Chuan Chang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p97-zhang.pdf</abstract></paper><paper><title>Designing Information-Preserving Mapping Schemes for XML.</title><author><AuthorName>Denilson Barbosa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Juliana Freire</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alberto O. Mendelzon</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p109-barbosa.pdf</abstract></paper><paper><title>Rewriting XPath Queries Using Materialized Views.</title><author><AuthorName>Wanhong Xu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Z. Meral {\"O}zsoyoglu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p121-xu.pdf</abstract></paper><paper><title>Benefits of Path Summaries in an XML Query Optimizer Supporting Multiple Access Methods.</title><author><AuthorName>Attila Barta</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mariano P. Consens</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alberto O. Mendelzon</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p133-barta.pdf</abstract></paper><paper><title>Efficient Processing of XML Path Queries Using the Disk-based F{\&}B Index.</title><author><AuthorName>Wei Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hongzhi Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hongjun Lu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Haifeng Jiang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Xuemin Lin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jianzhong Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p145-wang.pdf</abstract></paper><paper><title>Customizable Parallel Execution of Scientific Stream Queries.</title><author><AuthorName>Milena Ivanova</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Tore Risch</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p157-ivanova.pdf</abstract></paper><paper><title>Using Association Rules for Fraud Detection in Web Advertising Networks.</title><author><AuthorName>Ahmed Metwally</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>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p169-metwally.pdf</abstract></paper><paper><title>Parameter Free Bursty Events Detection in Text Streams.</title><author><AuthorName>Gabriel Pui Cheong Fung</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey Xu Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Philip S. Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hongjun Lu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p181-fung.pdf</abstract></paper><paper><title>From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching.</title><author><AuthorName>Jiaheng Lu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Tok Wang Ling</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chee Yong Chan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ting Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p193-lu.pdf</abstract></paper><paper><title>Tree-Pattern Queries on a Lightweight XML Processor.</title><author><AuthorName>Mirella Moura Moro</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Zografoula Vagena</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Vassilis J. Tsotras</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p205-moro.pdf</abstract></paper><paper><title>FiST: Scalable XML Document Filtering by Sequencing Twig Patterns.</title><author><AuthorName>Joonho Kwon</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Praveen Rao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Bongki Moon</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sukho Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p217-kwon.pdf</abstract></paper><paper><title>Maximal Vector Computation in Large Data Sets.</title><author><AuthorName>Parke Godfrey</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ryan Shipley</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jarek Gryz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p229-godfrey.pdf</abstract></paper><paper><title>Efficient Computation of the Skyline Cube.</title><author><AuthorName>Yidong Yuan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><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>Wei Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey Xu Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Qing Zhang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p241-yuan.pdf</abstract></paper><paper><title>Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces.</title><author><AuthorName>Jian Pei</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wen Jin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Martin Ester</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yufei Tao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p253-pei.pdf</abstract></paper><paper><title>Efficient Evaluation of XQuery over Streaming Data.</title><author><AuthorName>Xiaogang Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gagan Agrawal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p265-li.pdf</abstract></paper><paper><title>Semantic Query Optimization for XQuery over XML Streams.</title><author><AuthorName>Hong Su</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Elke A. Rundensteiner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Murali Mani</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p277-su.pdf</abstract></paper><paper><title>Statistical Learning Techniques for Costing XML Queries.</title><author><AuthorName>Ning Zhang 0002</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Peter J. Haas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Vanja Josifovski</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Guy M. Lohman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chun Zhang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p289-zhang.pdf</abstract></paper><paper><title>Approximate Matching of Hierarchical Data Using pq-Grams.</title><author><AuthorName>Nikolaus Augsten</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael H. B{\"o}hlen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Johann Gamper</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p301-augsten.pdf</abstract></paper><paper><title>The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS.</title><author><AuthorName>Vuk Ercegovac</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>David J. DeWitt</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raghu Ramakrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p313-ercegovac.pdf</abstract></paper><paper><title>n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure.</title><author><AuthorName>Min-Soo Kim 0002</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kyu-Young Whang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jae-Gil Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Min-Jae Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p325-kim.pdf</abstract></paper><paper><title>Query Translation from XPath to SQL in the Presence of Recursive DTDs.</title><author><AuthorName>Wenfei Fan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey Xu Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hongjun Lu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jianhua Lu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rajeev Rastogi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p337-fan.pdf</abstract></paper><paper><title>Pattern Tree Algebras: Sets or Sequences?</title><author><AuthorName>Stelios Paparizos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>H. V. Jagadish</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p349-paparizos.pdf</abstract></paper><paper><title>Structure and Content Scoring for XML.</title><author><AuthorName>Sihem Amer-Yahia</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nick Koudas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Am{\'e}lie Marian</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Divesh Srivastava</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>David Toman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p361-amer-yahia.pdf</abstract></paper><paper><title>Consistently Estimating the Selectivity of Conjuncts of Predicates.</title><author><AuthorName>Volker Markl</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nimrod Megiddo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Marcel Kutsch</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Tam Minh Tran</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Peter J. Haas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Utkarsh Srivastava</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p373-markl.pdf</abstract></paper><paper><title>Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases.</title><author><AuthorName>Jost Enderle</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nicole Schneider</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Thomas Seidl</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p385-enderle.pdf</abstract></paper><paper><title>Selectivity Estimation for Fuzzy String Predicates in Large Data Sets.</title><author><AuthorName>Liang Jin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chen Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p397-jin.pdf</abstract></paper><paper><title>Space Efficiency in Synopsis Construction Algorithms.</title><author><AuthorName>Sudipto Guha</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p409-guha.pdf</abstract></paper><paper><title>One-Pass Wavelet Synopses for Maximum-Error Metrics.</title><author><AuthorName>Panagiotis Karras</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nikos Mamoulis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p421-karras.pdf</abstract></paper><paper><title>MDL Summarization with Holes.</title><author><AuthorName>Shaofeng Bu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Laks V. S. Lakshmanan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raymond T. Ng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p433-bu.pdf</abstract></paper><paper><title>View Matching for Outer-Join Views.</title><author><AuthorName>Per-{\AA}ke Larson</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jingren Zhou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p445-larson.pdf</abstract></paper><paper><title>Caching with 'Good Enough' Currency, Consistency, and Completeness.</title><author><AuthorName>Hongfei Guo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Per-{\AA}ke Larson</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raghu Ramakrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p457-guo.pdf</abstract></paper><paper><title>Query Caching and View Selection for XML Databases.</title><author><AuthorName>Bhushan Mandhani</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dan Suciu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p469-mandhani.pdf</abstract></paper><paper><title>Optimizing Nested Queries with Parameter Sort Orders.</title><author><AuthorName>Ravindra Guravannavar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>H. S. Ramanujam</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>S. Sudarshan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p481-guravannavar.pdf</abstract></paper><paper><title>Stack-based Algorithms for Pattern Matching on DAGs.</title><author><AuthorName>Li Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Amarnath Gupta</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>M. Erdem Kurul</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p493-chen.pdf</abstract></paper><paper><title>Bidirectional Expansion For Keyword Search on Graph Databases.</title><author><AuthorName>Varun Kacholia</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shashank Pandit</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Soumen Chakrabarti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>S. Sudarshan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rushi Desai</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hrishikesh Karambelkar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/wed/p505-kacholia.pdf</abstract></paper><paper><title>Link Spam Alliances.</title><author><AuthorName>Zolt{\'a}n Gy{\"o}ngyi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hector Garcia-Molina</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p517-gyongyi.pdf</abstract></paper><paper><title>The SphereSearch Engine for Unified Ranked Retrieval of Heterogeneous XML and Web Documents.</title><author><AuthorName>Jens Graupmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ralf Schenkel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gerhard Weikum</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p529-graupmann.pdf</abstract></paper><paper><title>Hubble: An Advanced Dynamic Folder Technology for XML.</title><author><AuthorName>Ning Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Joshua Hui</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hui-I Hsiao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kevin S. Beyer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p541-li.pdf</abstract></paper><paper><title>C-Store: A Column-oriented DBMS.</title><author><AuthorName>Michael Stonebraker</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Daniel J. Abadi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Adam Batkin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Xuedong Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mitch Cherniack</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Miguel Ferreira</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Edmond Lau</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Amerson Lin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Samuel Madden</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Elizabeth J. O'Neil</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Patrick E. O'Neil</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alex Rasin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nga Tran</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Stanley B. Zdonik</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p553-stonebraker.pdf</abstract></paper><paper><title>Fine-Grained Replication and Scheduling with Freshness and Correctness Guarantees.</title><author><AuthorName>Fuat Akal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Can T{\"u}rker</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hans-J{\"o}rg Schek</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yuri Breitbart</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Torsten Grabs</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Lourens Veen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p565-akal.pdf</abstract></paper><paper><title>Cache-conscious Frequent Pattern Mining on a Modern Processor.</title><author><AuthorName>Amol Ghoting</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gregory Buehrer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Srinivasan Parthasarathy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Daehyun Kim</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anthony Nguyen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yen-Kuang Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Pradeep Dubey</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p577-ghoting.pdf</abstract></paper><paper><title>Parallel Execution of Test Runs for Database Application Systems.</title><author><AuthorName>Florian Haftmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Donald Kossmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Eric Lo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p589-haftmann.pdf</abstract></paper><paper><title>Query Execution Assurance for Outsourced Databases.</title><author><AuthorName>Radu Sion</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p601-sion.pdf</abstract></paper><paper><title>Automatic Composition of Transition-based Semantic Web Services with Messaging.</title><author><AuthorName>Daniela Berardi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Diego Calvanese</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Giuseppe De Giacomo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Richard Hull</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Massimo Mecella</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p613-berardi.pdf</abstract></paper><paper><title>An Efficient and Versatile Query Engine for TopX Search.</title><author><AuthorName>Martin Theobald</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ralf Schenkel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gerhard Weikum</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p625-theobald.pdf</abstract></paper><paper><title>KLEE: A Framework for Distributed Top-k Query Algorithms.</title><author><AuthorName>Sebastian Michel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Peter Triantafillou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gerhard Weikum</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p637-michel.pdf</abstract></paper><paper><title>Scaling and Time Warping in Time Series Querying.</title><author><AuthorName>Ada Wai-Chee Fu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Eamonn J. Keogh</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Leo Yung Hang Lau</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chotirat (Ann) Ratanamahatana</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p649-fu.pdf</abstract></paper><paper><title>BATON: A Balanced Tree Structure for Peer-to-Peer Networks.</title><author><AuthorName>H. V. Jagadish</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Beng Chin Ooi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Quang Hieu Vu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p661-jagadish.pdf</abstract></paper><paper><title>Client Assignment in Content Dissemination Networks for Dynamic Data.</title><author><AuthorName>Shetal Shah</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Krithi Ramamritham</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chinya V. Ravishankar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p673-shah.pdf</abstract></paper><paper><title>Indexing Data-oriented Overlay Networks.</title><author><AuthorName>Karl Aberer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anwitaman Datta</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Manfred Hauswirth</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Roman Schmidt</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p685-aberer.pdf</abstract></paper><paper><title>Streaming Pattern Discovery in Multiple Time-Series.</title><author><AuthorName>Spiros Papadimitriou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jimeng Sun</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christos Faloutsos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p697-papadimitriou.pdf</abstract></paper><paper><title>Mining Compressed Frequent-Pattern Sets.</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>Xifeng Yan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hong Cheng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p709-xin.pdf</abstract></paper><paper><title>Discovering Large Dense Subgraphs in Massive Graphs.</title><author><AuthorName>David Gibson</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ravi Kumar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Andrew Tomkins</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p721-gibson.pdf</abstract></paper><paper><title>General Purpose Database Summarization.</title><author><AuthorName>R{\'e}gis Saint-Paul</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Guillaume Raschia</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Noureddine Mouaddib</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p733-saint-paul.pdf</abstract></paper><paper><title>Online Estimation For Subset-Based SQL Queries.</title><author><AuthorName>Chris Jermaine</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alin Dobra</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Abhijit Pol</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shantanu Joshi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p745-jermaine.pdf</abstract></paper><paper><title>Content-Based Routing: Different Plans for Different Data.</title><author><AuthorName>Pedro Bizarro</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shivnath Babu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>David J. DeWitt</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jennifer Widom</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p757-bizarro.pdf</abstract></paper><paper><title>REED: Robust, Efficient Filtering and Event Detection in Sensor Networks.</title><author><AuthorName>Daniel J. Abadi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Samuel Madden</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wolfgang Lindner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p769-abadi.pdf</abstract></paper><paper><title>Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results.</title><author><AuthorName>Sandeep Pandey</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sourashis Roy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christopher Olston</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Junghoo Cho</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Soumen Chakrabarti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p781-pandey.pdf</abstract></paper><paper><title>Indexing Mixed Types for Approximate Retrieval.</title><author><AuthorName>Liang Jin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nick Koudas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chen Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anthony K. H. Tung</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p793-jin.pdf</abstract></paper><paper><title>Answering Queries from Statistics and Probabilistic Views.</title><author><AuthorName>Nilesh N. Dalvi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dan Suciu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p805-dalvi.pdf</abstract></paper><paper><title>Inspector Joins.</title><author><AuthorName>Shimin Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anastassia Ailamaki</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Phillip B. Gibbons</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Todd C. Mowry</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p817-chen.pdf</abstract></paper><paper><title>Revisiting Pipelined Parallelism in Multi-Join Query Processing.</title><author><AuthorName>Bin Liu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Elke A. Rundensteiner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p829-liu.pdf</abstract></paper><paper><title>Early Hash Join: A Configurable Algorithm for the Efficient and Early Production of Join Results.</title><author><AuthorName>Ramon Lawrence</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/thu/p841-lawrence.pdf</abstract></paper><paper><title>On Map-Matching Vehicle Tracking Data.</title><author><AuthorName>Sotiris Brakatsoulas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dieter Pfoser</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Randall Salas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Carola Wenk</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p853-brakatsoulas.pdf</abstract></paper><paper><title>An Efficient and Scalable Approach to CNN Queries in a Road Network.</title><author><AuthorName>Hyung-Ju Cho</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chin-Wan Chung</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p865-cho.pdf</abstract></paper><paper><title>Complex Spatio-Temporal Pattern Queries.</title><author><AuthorName>Marios Hadjieleftheriou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>George Kollios</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Petko Bakalov</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Vassilis J. Tsotras</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p877-hadjieleftheriou.pdf</abstract></paper><paper><title>Distributed Privacy Preserving Information Sharing.</title><author><AuthorName>Nan Zhang 0004</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wei Zhao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p889-zhang.pdf</abstract></paper><paper><title>On k-Anonymity and the Curse of Dimensionality.</title><author><AuthorName>Charu C. Aggarwal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p901-aggarwal.pdf</abstract></paper><paper><title>Checking for k-Anonymity Violation by Views.</title><author><AuthorName>Chao Yao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Xiaoyang Sean Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sushil Jajodia</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p910-yao.pdf</abstract></paper><paper><title>Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions.</title><author><AuthorName>Yufei Tao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Reynold Cheng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Xiaokui Xiao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wang Kay Ngai</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ben Kao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sunil Prabhakar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p922-tao.pdf</abstract></paper><paper><title>A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing.</title><author><AuthorName>Slobodan Rasetic</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>J{\"o}rg Sander</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>James Elding</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mario A. Nascimento</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p934-rasetic.pdf</abstract></paper><paper><title>On Computing Top-t Most Influential Spatial Sites.</title><author><AuthorName>Tian Xia</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Donghui Zhang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Evangelos Kanoulas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yang Du</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p946-xia.pdf</abstract></paper><paper><title>Efficient Implementation of Large-Scale Multi-Structural Databases.</title><author><AuthorName>Ronald Fagin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Phokion G. Kolaitis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ravi Kumar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jasmine Novak</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>D. Sivakumar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Andrew Tomkins</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p958-fagin.pdf</abstract></paper><paper><title>OLAP Over Uncertain and Imprecise Data.</title><author><AuthorName>Douglas Burdick</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Prasad Deshpande</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>T. S. Jayram</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raghu Ramakrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shivakumar Vaithyanathan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p970-burdick.pdf</abstract></paper><paper><title>Prediction Cubes.</title><author><AuthorName>Bee-Chung Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Lei Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yi Lin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raghu Ramakrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p982-chen.pdf</abstract></paper><paper><title>Tuning Schema Matching Software using Synthetic Scenarios.</title><author><AuthorName>Mayssam Sayyadian</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yoonkyong Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>AnHai Doan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Arnon Rosenthal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p994-sayyadian.pdf</abstract></paper><paper><title>Semantic Adaptation of Schema Mappings when Schemas Evolve.</title><author><AuthorName>Cong Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Lucian Popa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p1006-yu.pdf</abstract></paper><paper><title>Mapping Maintenance for Data Integration Systems.</title><author><AuthorName>Robert McCann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Bedoor K. AlShebli</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Quoc Le</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hoa Nguyen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Long Vu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>AnHai Doan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/fri/p1018-mccann.pdf</abstract></paper><paper><title>Bridging the Gap between OLAP and SQL.</title><author><AuthorName>Jens-Peter Dittrich</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Donald Kossmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alexander Kreutz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2005</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb2005.org/program/paper/tue/p1031-dittrich.pdf</abstract></paper><paper><title>Optimizing Refresh of a Set of Materialized Views.</title><author><AuthorName>Nathan Folkert</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Abhinav Gupta</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Andrew Witkowski</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sankar Subramanian</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Srikanth Bellamkonda</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shrikanth Shankar</AuthorName><i⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -