📄 vldb_2006_elementary.txt
字号:
<proceedings><paper><title>Enterprise Information Mashups: Integrating Information, Simply.</title><author><AuthorName>Anant Jhingran</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p3-jhingran.pdf</abstract></paper><paper><title>Next Generation Data Management in Enterprise Application Platforms.</title><author><AuthorName>Vishal Sikka</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p5-sikka.pdf</abstract></paper><paper><title>Data Integration: The Teenage Years.</title><author><AuthorName>Alon Y. Halevy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anand Rajaraman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Joann J. Ordille</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p9-halevy.pdf</abstract></paper><paper><title>Safety Guarantee of Continuous Join Queries over Punctuated Data Streams.</title><author><AuthorName>Hua-Gang Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Songting Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jun'ichi Tatemura</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Divyakant Agrawal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>K. Sel\c{c}uk Candan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wang-Pin Hsiung</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p19-li.pdf</abstract></paper><paper><title>Scalable Continuous Query Processing by Tracking Hotspots.</title><author><AuthorName>Pankaj K. Agarwal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Junyi Xie</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jun Yang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hai Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p31-agarwal.pdf</abstract></paper><paper><title>Continuous Nearest Neighbor Monitoring in Road Networks.</title><author><AuthorName>Kyriakos Mouratidis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Man Lung Yiu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dimitris Papadias</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nikos Mamoulis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p43-mouratidis.pdf</abstract></paper><paper><title>Implementing Mapping Composition.</title><author><AuthorName>Philip A. Bernstein</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Todd J. Green</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sergey Melnik</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alan Nash</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p55-bernstein.pdf</abstract></paper><paper><title>Nested Mappings: Schema Mapping Reloaded.</title><author><AuthorName>Ariel Fuxman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mauricio A. Hern{\'a}ndez</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>C. T. Howard Ho</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>Paolo Papotti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Lucian Popa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p67-fuxman.pdf</abstract></paper><paper><title>Debugging Schema Mappings with Routes.</title><author><AuthorName>Laura Chiticariu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wang Chiew Tan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p79-chiticariu.pdf</abstract></paper><paper><title>A Linear Time Algorithm for Optimal Tree Sibling Partitioning and Approximation Algorithms in Natix.</title><author><AuthorName>Carl-Christian Kanne</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Guido Moerkotte</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p91-kanne.pdf</abstract></paper><paper><title>Efficient Discovery of XML Data Redundancies.</title><author><AuthorName>Cong Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>H. V. Jagadish</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p103-yu.pdf</abstract></paper><paper><title>Inference of Concise DTDs from XML Data.</title><author><AuthorName>Geert Jan Bex</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Frank Neven</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Thomas Schwentick</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Karl Tuyls</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p115-bex.pdf</abstract></paper><paper><title>Efficient Secure Query Evaluation over Encrypted XML Databases.</title><author><AuthorName>Hui Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Laks V. S. Lakshmanan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p127-wang.pdf</abstract></paper><paper><title>Anatomy: Simple and Effective Privacy Preservation.</title><author><AuthorName>Xiaokui Xiao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yufei Tao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p139-xiao.pdf</abstract></paper><paper><title>Towards Robustness in Query Auditing.</title><author><AuthorName>Shubha U. Nabar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Bhaskara Marthi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Krishnaram Kenthapadi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nina Mishra</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rajeev Motwani</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p151-nabar.pdf</abstract></paper><paper><title>Adaptive Cleaning for RFID Data Streams.</title><author><AuthorName>Shawn R. Jeffery</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Minos N. Garofalakis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael J. Franklin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p163-jeffery.pdf</abstract></paper><paper><title>A Deferred Cleansing Method for RFID Data Analytics.</title><author><AuthorName>Jun Rao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sangeeta Doraiswamy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hetal Thakkar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Latha S. Colby</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p175-rao.pdf</abstract></paper><paper><title>Online Outlier Detection in Sensor Data Using Non-Parametric Models.</title><author><AuthorName>Sharmila Subramaniam</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Themis Palpanas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dimitris Papadopoulos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Vana Kalogeraki</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dimitrios Gunopulos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p187-subramaniam.pdf</abstract></paper><paper><title>Relaxing Join and Selection Queries.</title><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><author><AuthorName>Rares Vernica</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p199-koudas.pdf</abstract></paper><paper><title>Using Partial Evaluation in Distributed Query Evaluation.</title><author><AuthorName>Peter Buneman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gao Cong</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wenfei Fan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anastasios Kementsietsidis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p211-buneman.pdf</abstract></paper><paper><title>TRAC: Toward Recency and Consistency Reporting in a Database with Distributed Data Sources.</title><author><AuthorName>Jiansheng Huang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey F. Naughton</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Miron Livny</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p223-huang.pdf</abstract></paper><paper><title>Towards Robust Indexing for Ranked Queries.</title><author><AuthorName>Dong Xin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chen Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jiawei Han</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p235-xin.pdf</abstract></paper><paper><title>An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data.</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>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p247-augsten.pdf</abstract></paper><paper><title>FIX: Feature-based Indexing Technique for XML Documents.</title><author><AuthorName>Ning Zhang 0002</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>M. Tamer {\"O}zsu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ihab F. Ilyas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ashraf Aboulnaga</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p259-zhang.pdf</abstract></paper><paper><title>Type-Based XML Projection.</title><author><AuthorName>V{\'e}ronique Benzaken</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Giuseppe Castagna</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dario Colazzo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kim Nguyen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p271-benzaken.pdf</abstract></paper><paper><title>Twig$^{\mbox{2}}$Stack: Bottom-up Processing of Generalized-Tree-Pattern Queries over XML Documents.</title><author><AuthorName>Songting Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hua-Gang Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jun'ichi Tatemura</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wang-Pin Hsiung</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Divyakant Agrawal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>K. Sel\c{c}uk Candan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p283-chen.pdf</abstract></paper><paper><title>An Algebraic Query Model for Effective and Efficient Retrieval of XML Fragments.</title><author><AuthorName>Sujeet Pradhan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p295-pradhan.pdf</abstract></paper><paper><title>Putting Context into Schema Matching.</title><author><AuthorName>Philip Bohannon</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Eiman Elnahrawy</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><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p307-bohannon.pdf</abstract></paper><paper><title>Schema Summarization.</title><author><AuthorName>Cong Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>H. V. Jagadish</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p319-yu.pdf</abstract></paper><paper><title>Multi-column Substring Matching for Database Schema Translation.</title><author><AuthorName>Robert H. Warren</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Frank Wm. Tompa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p331-warren.pdf</abstract></paper><paper><title>Querying Business Processes.</title><author><AuthorName>Catriel Beeri</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anat Eyal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Simon Kamenkovich</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Tova Milo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p343-beeri.pdf</abstract></paper><paper><title>Query Optimization over Web Services.</title><author><AuthorName>Utkarsh Srivastava</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kamesh Munagala</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jennifer Widom</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rajeev Motwani</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p355-srivastava.pdf</abstract></paper><paper><title>iDM: A Unified and Versatile Data Model for Personal Dataspace Management.</title><author><AuthorName>Jens-Peter Dittrich</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Marcos Antonio Vaz Salles</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p367-dittrich.pdf</abstract></paper><paper><title>CURE for Cubes: Cubing Using a ROLAP Engine.</title><author><AuthorName>Konstantinos Morfonios</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yannis E. Ioannidis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p379-morfonios.pdf</abstract></paper><paper><title>Efficient Allocation Algorithms for OLAP Over Imprecise Data.</title><author><AuthorName>Douglas Burdick</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Prasad M. 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>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p391-burdick.pdf</abstract></paper><paper><title>Composite Subset Measures.</title><author><AuthorName>Lei Chen 0003</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raghu Ramakrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Paul Barford</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Bee-Chung Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Vinod Yegneswaran</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p403-chen.pdf</abstract></paper><paper><title>Efficient and Decentralized PageRank Approximation in a Peer-to-Peer Web Search Network.</title><author><AuthorName>Josiane Xavier Parreira</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Debora Donato</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sebastian Michel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gerhard Weikum</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p415-xavier\%20parreira.pdf</abstract></paper><paper><title>LinkClus: Efficient Clustering via Heterogeneous Semantic Links.</title><author><AuthorName>Xiaoxin Yin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jiawei Han</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Philip S. Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p427-yin.pdf</abstract></paper><paper><title>Link Spam Detection Based on Mass Estimation.</title><author><AuthorName>Zolt{\'a}n Gy{\"o}ngyi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Pavel Berkhin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hector Garcia-Molina</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jan Pedersen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p439-gyongyi.pdf</abstract></paper><paper><title>Answering Top-k Queries Using Views.</title><author><AuthorName>Gautam Das</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>Dimitris Tsirogiannis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p451-das.pdf</abstract></paper><paper><title>Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach.</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>Hong Cheng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Xiaolei Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p463-xin.pdf</abstract></paper><paper><title>IO-Top-k: Index-access Optimized Top-k Query Processing.</title><author><AuthorName>Holger Bast</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Debapriyo Majumdar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ralf Schenkel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Martin Theobald</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gerhard Weikum</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p475-bast.pdf</abstract></paper><paper><title>Performance Tradeoffs in Read-Optimized Databases.</title><author><AuthorName>Stavros Harizopoulos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Velen Liang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><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><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p487-harizopoulos.pdf</abstract></paper><paper><title>To Tune or not to Tune? A Lightweight Physical Design Alerter.</title><author><AuthorName>Nicolas Bruno</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Surajit Chaudhuri</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p499-bruno.pdf</abstract></paper><paper><title>Efficient Scheduling of Heterogeneous Continuous Queries.</title><author><AuthorName>Mohamed A. Sharaf</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Panos K. Chrysanthis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alexandros Labrinidis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kirk Pruhs</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p511-sharaf.pdf</abstract></paper><paper><title>Indexing for Function Approximation.</title><author><AuthorName>Biswanath Panda</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mirek Riedewald</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Stephen B. Pope</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Johannes Gehrke</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>L. Paul Chew</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p523-panda.pdf</abstract></paper><paper><title>Active and Accelerated Learning of Cost Models for Optimizing Scientific Applications.</title><author><AuthorName>Piyush Shivam</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shivnath Babu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey S. Chase</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p535-shivam.pdf</abstract></paper><paper><title>Adaptive Execution of Variable-Accuracy Functions.</title><author><AuthorName>Matthew Denny</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael J. Franklin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p547-denny.pdf</abstract></paper><paper><title>AFilter: Adaptable XML Filtering with Prefix-Caching and Suffix-Clustering.</title><author><AuthorName>K. Sel\c{c}uk Candan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wang-Pin Hsiung</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Songting Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jun'ichi Tatemura</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Divyakant Agrawal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p559-candan.pdf</abstract></paper><paper><title>Answering Tree Pattern Queries Using Views.</title><author><AuthorName>Laks V. S. Lakshmanan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hui Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Zheng (Jessica) Zhao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p571-lakshmanan.pdf</abstract></paper><paper><title>Maintaining XPath Views In Loosely Coupled Systems.</title><author><AuthorName>Arsany Sawires</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jun'ichi Tatemura</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Oliver Po</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><author><AuthorName>K. Sel\c{c}uk Candan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p583-sawires.pdf</abstract></paper><paper><title>A Dip in the Reservoir: Maintaining Sample Synopses of Evolving Datasets.</title><author><AuthorName>Rainer Gemulla</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wolfgang Lehner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Peter J. Haas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p595-gemulla.pdf</abstract></paper><paper><title>On Biased Reservoir Sampling in the Presence of Stream Evolution.</title><author><AuthorName>Charu C. Aggarwal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p607-aggarwal.pdf</abstract></paper><paper><title>State-Slice: New Paradigm of Multi-query Optimization of Window-based Stream Queries.</title><author><AuthorName>Song Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Elke A. Rundensteiner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Samrat Ganguly</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sudeept Bhatnagar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p619-wang.pdf</abstract></paper><paper><title>Similarity Search: A Matching Based Approach.</title><author><AuthorName>Anthony K. H. Tung</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rui Zhang 0003</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nick Koudas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Beng Chin Ooi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p631-tung.pdf</abstract></paper><paper><title>Progressive Computation of the Min-Dist Optimal-Location Query.</title><author><AuthorName>Donghui Zhang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yang Du</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Tian Xia</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yufei Tao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p643-zhang.pdf</abstract></paper><paper><title>Bellwether Analysis: Predicting Global Aggregates from Local Regions.</title><author><AuthorName>Bee-Chung Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raghu Ramakrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jude W. Shavlik</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Pradeep Tamma</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p655-chen.pdf</abstract></paper><paper><title>Efficiently Linking Text Documents with Relevant Structured Information.</title><author><AuthorName>Venkatesan T. Chakaravarthy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Himanshu Gupta</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Prasan Roy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mukesh K. Mohania</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p667-chakaravarthy.pdf</abstract></paper><paper><title>Meaningful Labeling of Integrated Query Interfaces.</title><author><AuthorName>Eduard C. Dragut</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Clement T. Yu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Weiyi Meng</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p679-dragut.pdf</abstract></paper><paper><title>GORDIAN: Efficient and Scalable Discovery of Composite Keys.</title><author><AuthorName>Yannis Sismanis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><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><author><AuthorName>Berthold Reinwald</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p691-sismanis.pdf</abstract></paper><paper><title>An Integrated Approach to Recovery and High Availability in an Updatable, Distributed Data Warehouse.</title><author><AuthorName>Edmond Lau</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Samuel Madden</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p703-lau.pdf</abstract></paper><paper><title>Lazy Database Replication with Snapshot Isolation.</title><author><AuthorName>Khuzaima Daudjee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kenneth Salem</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p715-daudjee.pdf</abstract></paper><paper><title>Delay Aware Querying with Seaweed.</title><author><AuthorName>Dushyanth Narayanan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Austin Donnelly</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Richard Mortier</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Antony Rowstron</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p727-narayanan.pdf</abstract></paper><paper><title>Full Disjunctions: Polynomial-Delay Iterators in Action.</title><author><AuthorName>Sara Cohen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Itzhak Fadida</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yaron Kanza</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Benny Kimelfeld</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yehoshua Sagiv</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p739-cohen.pdf</abstract></paper><paper><title>The Spatial Skyline Queries.</title><author><AuthorName>Mehdi Sharifzadeh</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Cyrus Shahabi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p751-sharifzadeh.pdf</abstract></paper><paper><title>The New Casper: Query Processing for Location Services without Compromising Privacy.</title><author><AuthorName>Mohamed F. Mokbel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chi-Yin Chow</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Walid G. Aref</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p763-mokbel.pdf</abstract></paper><paper><title>Providing Resiliency to Load Variations in Distributed Stream Processing.</title><author><AuthorName>Ying Xing</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeong-Hyon Hwang</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><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p775-xing.pdf</abstract></paper><paper><title>Load Shedding in Stream Databases: A Control-Based Approach.</title><author><AuthorName>Yi-Cheng Tu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Song Liu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sunil Prabhakar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Bin Yao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p787-tu.pdf</abstract></paper><paper><title>Window-Aware Load Shedding for Aggregation Queries over Data Streams.</title><author><AuthorName>Nesime Tatbul</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Stanley B. Zdonik</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p799-tatbul.pdf</abstract></paper><paper><title>Mining Frequent Closed Cubes in 3D Datasets.</title><author><AuthorName>Liping Ji</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Kian-Lee Tan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anthony K. H. Tung</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p811-ji.pdf</abstract></paper><paper><title>Efficient Incremental Maintenance of Data Cubes.</title><author><AuthorName>Ki Yong Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Myoung-Ho Kim</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p823-lee.pdf</abstract></paper><paper><title>FlowCube: Constructuing RFID FlowCubes for Multi-Dimensional Analysis of Commodity Flows.</title><author><AuthorName>Hector Gonzalez</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><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p834-gonzalez.pdf</abstract></paper><paper><title>Approximate Encoding for Direct Access and Query Processing over Compressed Bitmaps.</title><author><AuthorName>Tan Apaydin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Guadalupe Canahuate</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hakan Ferhatosmanoglu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ali Tosun</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p846-apaydin.pdf</abstract></paper><paper><title>How to Wring a Table Dry: Entropy Compression of Relations and Querying of Compressed Relations.</title><author><AuthorName>Vijayshankar Raman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Garret Swart</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p858-raman.pdf</abstract></paper><paper><title>Compact Histograms for Hierarchical Identifiers.</title><author><AuthorName>Frederick Reiss</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Minos N. Garofalakis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Joseph M. Hellerstein</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p870-reiss.pdf</abstract></paper><paper><title>LB_Keogh Supports Exact Indexing of Shapes under Rotation Invariance with Arbitrary Representations and Distance Measures.</title><author><AuthorName>Eamonn J. Keogh</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Li Wei</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Xiaopeng Xi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sang-Hee Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michail Vlachos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p882-keogh.pdf</abstract></paper><paper><title>Distance Indexing on Road Networks.</title><author><AuthorName>Haibo Hu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dik Lun Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Victor C. S. Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p894-hu.pdf</abstract></paper><paper><title>Reference-based Indexing of Sequence Databases.</title><author><AuthorName>Jayendra Venkateswaran</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Deepak Lachwani</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Tamer Kahveci</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christopher M. Jermaine</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p906-venkateswaran.pdf</abstract></paper><paper><title>Efficient Exact Set-Similarity Joins.</title><author><AuthorName>Arvind Arasu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Venkatesh Ganti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raghav Kaushik</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p918-arasu.pdf</abstract></paper><paper><title>Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products.</title><author><AuthorName>Guido Moerkotte</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Thomas Neumann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p930-moerkotte.pdf</abstract></paper><paper><title>Containment of Conjunctive Object Meta-Queries.</title><author><AuthorName>Andrea Cal\`{\i}</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael Kifer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p942-cali.pdf</abstract></paper><paper><title>ULDBs: Databases with Uncertainty and Lineage.</title><author><AuthorName>Omar Benjelloun</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anish Das Sarma</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alon Y. Halevy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jennifer Widom</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p953-benjelloun.pdf</abstract></paper><paper><title>Creating Probabilistic Databases from Information Extraction Models.</title><author><AuthorName>Rahul Gupta</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sunita Sarawagi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p965-gupta.pdf</abstract></paper><paper><title>Quality Views: Capturing and Exploiting the User Perspective on Data Quality.</title><author><AuthorName>Paolo Missier</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Suzanne M. Embury</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mark Greenwood</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alun D. Preece</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Binling Jin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p977-missier.pdf</abstract></paper><paper><title>Automatic Extraction of Dynamic Record Sections From Search Engine Result Pages.</title><author><AuthorName>Hongkun Zhao</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><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p989-zhao.pdf</abstract></paper><paper><title>Trustworthy Keyword Search for Regulatory-Compliant Record Retention.</title><author><AuthorName>Soumyadeb Mitra</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Windsor W. Hsu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Marianne Winslett</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p1001-mitra.pdf</abstract></paper><paper><title>Efficient Detection of Empty-Result Queries.</title><author><AuthorName>Gang Luo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p1015-luo.pdf</abstract></paper><paper><title>Cost-Based Query Transformation in Oracle.</title><author><AuthorName>Rafi Ahmed</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Allison Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Andrew Witkowski</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dinesh Das</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hong Su</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mohamed Za\"{\i}t</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Thierry Cruanes</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p1026-ahmed.pdf</abstract></paper><paper><title>Query Processing in the AquaLogic Data Services Platform.</title><author><AuthorName>Vinayak R. Borkar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michael J. Carey</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dmitry Lychagin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Till Westmann</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Daniel Engovatov</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nicola Onose</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p1037-borkar.pdf</abstract></paper><paper><title>The Making of TPC-DS.</title><author><AuthorName>Raghunath Othayoth</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Meikel Poess</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p1049-othayoth.pdf</abstract></paper><paper><title>Data Mining with the SAP Netweaver BI Accelerator.</title><author><AuthorName>Thomas Legler</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wolfgang Lehner</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Andrew Ross</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p1059-legler.pdf</abstract></paper><paper><title>Contest of XML Lock Protocols.</title><author><AuthorName>Michael Peter Haustein</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Theo H{\"a}rder</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Konstantin Luttenberger</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2006</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract>http://www.vldb.org/conf/2006/p1069-haustein.pdf</abstract></paper><paper><title>Adaptive Self-tuning Memory in DB2.</title><author><AuthorName>Adam J. Storm</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christian Garcia-Arellano</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sam Lightstone</AuthorName><⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -