vldb_2000_elementary.txt

利用lwp：：get写的

 The MIT Press and McGraw-Hill Book Company 1989, ISBN 0-262-03141-8,0-07-013143-0</name><name>Computing the median with uncertainty.</name><name>Computer and Intractability: A Guide to the Theory of NP-Completeness.
 W. H. Freeman 1979, ISBN 0-7167-1044-7</name><name>New Sampling-Based Summary Statistics for Improving Approximate Query Answers.</name><name>The Dangers of Replication and a Solution.</name><name>Scalable Trigger Processing.</name><name>Interactive data Analysis: The Control Project.</name><name>Online Aggregation.</name><name>Divergence Caching in Client Server Architectures.</name><name>Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems.</name><name>Constraint Query Languages.</name><name>Aggregation in Constraint Databases.</name><name>Quality-driven Integration of Heterogenous Information Systems.</name><name>DataSplash.</name><name>Fast Approximate Query Answering Using Precomputed Statistics.</name><name>A Multi-Resolution Relational Data Model.</name><name>Aggregates in Possibilistic Databases.</name><name>Moving Objects Databases: Issues and Solutions.</name></citation><abstract></abstract></paper><paper><title>Manipulating Interpolated Data is Easier than You Thought.</title><author><AuthorName>St{\'e}phane Grumbach</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Philippe Rigaux</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Luc Segoufin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation><name>A Geometric Framework for Specifying Spatiotemporal Objects.</name><name>Spatio-Temporal Data Types: An Approach to Modeling and Querying Moving Objects in Databases.</name><name>A Data Model and Data Structures for Moving Objects Databases.</name><name>Chorochronos: A Research Network for Spatiotemporal Database Systems.</name><name>Spatio-Temporal Data Handling with Constraints.</name><name>Constraint Query Languages.</name><name>On Indexing Mobile Objects.</name><name>The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases.</name><name>Optimization and Evaluation of Database Queries Including Embedded Interpolation Procedures.</name><name>Capturing the Uncertainty of Moving-Object Representations.</name><name>Indexing the Positions of Continuously Moving Objects.</name><name>Oracle8i Spatial: Experiences with Extensible Databases.</name><name>Modeling and Querying Moving Objects.</name><name>On the Generation of Spatiotemporal Datasets.</name><name>Digital Elevation Models and TIN Algorithms.</name><name>DOMINO: Databases fOr MovINg Objects tracking.</name><name></name></citation><abstract></abstract></paper><paper><title>Using SQL to Build New Aggregates and Extenders for Object- Relational Systems.</title><author><AuthorName>Haixun Wang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Carlo Zaniolo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Fast Algorithms for Mining Association Rules in Large Databases.</name><name>Using the New DB2: IBM's Object-Relational Database System.</name><name>Managing Temporal Financial Data in an Extensible Database.</name><name>Scalable Classification over SQL Databases.</name><name>Querying Multiple Features of Groups in Relational Databases.</name><name>Groupwise Processing of Relational Queries.</name><name>Online Aggregation.</name><name>Approximate Medians and other Quantiles in One Pass and with Limited Memory.</name><name>Temporal Aggregation in Active Database Rules.</name><name>Integrating Mining with Relational Database Systems: Alternatives and Implications.</name><name>SPRINT: A Scalable Parallel Classifier for Data Mining.</name><name>The Design and Implementation of a Sequence Database System.</name><name>The Implementation of Postgres.</name><name>User-Defined Aggregates for Datamining.</name><name>User Defined Aggregates in Object-Relational Systems.</name><name>User-Defined Aggregates in Database Languages.</name><name>Advanced Database Systems.</name><name></name></citation><abstract></abstract></paper><paper><title>ICICLES: Self-Tuning Samples for Approximate Query Answering.</title><author><AuthorName>Venkatesh Ganti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mong-Li Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raghu Ramakrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation><name>The Aqua Approximate Query Answering System.</name><name>Join Synopses for Approximate Query Answering.</name><name>The New Jersey Data Reduction Report.</name><name>On Random Sampling over Joins.</name><name>Caching Multidimensional Queries Using Chunks.</name><name>New Sampling-Based Summary Statistics for Improving Approximate Query Answers.</name><name>Online Aggregation.</name><name>Approximate Query Answering with Frequent Sets and Maximum Entropy.</name><name>Random Sampling from Databases.
Ph.D. thesis,  University of California at Berkeley LBL Technical Report 1993</name><name>Fast Approximate Answers to Aggregate Queries on a Data Cube.</name><name>Random Sampling with a Reservoir.</name><name>APPROXIMATE - A Query Processor that Produces Monotonically Improving Approximate Answers.</name><name>Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets.</name><name>Data Cube Approximation and Histograms via Wavelets.</name></citation><abstract></abstract></paper><paper><title>Caching Strategies for Data-Intensive Web Sites.</title><author><AuthorName>Khaled Yagoub</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Daniela Florescu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Val{\'e}rie Issarny</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Patrick Valduriez</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>The Evolution of the Web and Implications for an Incremental Crawler.</title><author><AuthorName>Junghoo Cho</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hector Garcia-Molina</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>CheeTah: a Lightweight Transaction Server for Plug-and-Play Internet Data Management.</title><author><AuthorName>Guy Pardon</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gustavo Alonso</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Hypothetical Queries in an OLAP Environment.</title><author><AuthorName>Andrey Balmin</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Thanos Papadimitriou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yannis Papakonstantinou</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Hierarchical Compact Cube for Range-Max Queries.</title><author><AuthorName>Sin Yeung Lee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Tok Wang Ling</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hua-Gang Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Temporal Queries in OLAP.</title><author><AuthorName>Alberto O. Mendelzon</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alejandro A. Vaisman</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Integrating the UB-Tree into a Database System Kernel.</title><author><AuthorName>Frank Ramsak</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Volker Markl</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Robert Fenk</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Martin Zirkel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Klaus Elhardt</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rudolf Bayer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Multi-Dimensional Database Allocation for Parallel Data Warehouses.</title><author><AuthorName>Thomas St{\"o}hr</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Holger M{\"a}rtens</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Erhard Rahm</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Oracle8i Index-Organized Table and Its Application to New Domains.</title><author><AuthorName>Jagannathan Srinivasan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Souripriya Das</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chuck Freiwald</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Eugene Inseok Chong</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mahesh Jagannath</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Aravind Yalamanchi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Ramkumar Krishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Anh-Tuan Tran</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Samuel DeFazio</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jayanta Banerjee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>FALCON: Feedback Adaptive Loop for Content-Based Retrieval.</title><author><AuthorName>Leejay Wu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christos Faloutsos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Katia P. Sycara</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Terry R. Payne</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>User-Adaptive Exploration of Multidimensional Data.</title><author><AuthorName>Sunita Sarawagi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Toward Learning Based Web Query Processing.</title><author><AuthorName>Yanlei Diao</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hongjun Lu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Songting Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Zengping Tian</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Optimizing Queries on Compressed Bitmaps.</title><author><AuthorName>Sihem Amer-Yahia</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Theodore Johnson</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>What Happens During a Join? Dissecting CPU and Memory Optimization Effects.</title><author><AuthorName>Stefan Manegold</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Peter A. Boncz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Martin L. Kersten</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Set Containment Joins: The Good, The Bad and The Ugly.</title><author><AuthorName>Karthikeyan Ramasamy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jignesh M. Patel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jeffrey F. Naughton</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raghav Kaushik</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Identifying Representative Trends in Massive Time Series Data Sets Using Sketches.</title><author><AuthorName>Piotr Indyk</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nick Koudas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>S. Muthukrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Decision Tables: Scalable Classification Exploring RDBMS Capabilities.</title><author><AuthorName>Hongjun Lu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hongyan Liu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Fast Time Sequence Indexing for Arbitrary Lp Norms.</title><author><AuthorName>Byoung-Kee Yi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christos Faloutsos</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Novel Approaches in Query Processing for Moving Object Trajectories.</title><author><AuthorName>Dieter Pfoser</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christian S. Jensen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yannis Theodoridis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Managing Intervals Efficiently in Object-Relational Databases.</title><author><AuthorName>Hans-Peter Kriegel</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Marco P{\"o}tke</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Thomas Seidl</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Optimizing Multi-Feature Queries for Image Databases.</title><author><AuthorName>Ulrich G{\"u}ntzer</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Wolf-Tilo Balke</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Werner Kie{\ss}ling</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches.</title><author><AuthorName>Jonathan Goldstein</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Raghu Ramakrishnan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Temporal Integrity Constraints with Indeterminacy.</title><author><AuthorName>Wes Cowley</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dimitris Plexousakis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>The BT-tree: A Branched and Temporal Access Method.</title><author><AuthorName>Linan Jiang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Betty Salzberg</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>David B. Lomet</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Manuel Barrena Garc\'{\i}a</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Performance Issues in Incremental Warehouse Maintenance.</title><author><AuthorName>Wilburt Labio</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jun Yang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Yingwei Cui</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hector Garcia-Molina</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jennifer Widom</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>The Challenge of Process Data Warehousing.</title><author><AuthorName>Matthias Jarke</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Thomas List</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>J{\"o}rg K{\"o}ller</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>A Scalable Algorithm for Answering Queries Using Views.</title><author><AuthorName>Rachel Pottinger</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alon Y. Levy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Automated Selection of Materialized Views and Indexes in SQL Databases.</title><author><AuthorName>Sanjay Agrawal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Surajit Chaudhuri</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Vivek R. Narasayya</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>What Is the Nearest Neighbor in High Dimensional Spaces?</title><author><AuthorName>Alexander Hinneburg</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Charu C. Aggarwal</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Daniel A. Keim</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation.</title><author><AuthorName>Yasushi Sakurai</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Masatoshi Yoshikawa</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shunsuke Uemura</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Haruhiko Kojima</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Focused Crawling Using Context Graphs.</title><author><AuthorName>Michelangelo Diligenti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Frans Coetzee</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Steve Lawrence</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>C. Lee Giles</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Marco Gori</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Approximating Aggregate Queries about Web Pages via Random Walks.</title><author><AuthorName>Ziv Bar-Yossef</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alexander Berg</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Steve Chien</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jittat Fakcharoenphol</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dror Weitz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Computing Geographical Scopes of Web Resources.</title><author><AuthorName>Junyan Ding</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Luis Gravano</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Narayanan Shivakumar</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>A Case-Based Approach to Information Integration.</title><author><AuthorName>Maurizio Panti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Luca Spalazzi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alberto Giretti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Approximate Query Translation Across Heterogeneous Information Sources.</title><author><AuthorName>Kevin Chen-Chuan Chang</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Hector Garcia-Molina</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Design and Development of a Stream Service in a Heterogenous Client Environment.</title><author><AuthorName>Nikos Pappas</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Stavros Christodoulakis</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Semantic Access: Semantic Interface for Querying Databases.</title><author><AuthorName>Naphtali Rishe</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Jun Yuan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rukshan Athauda</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Shu-Ching Chen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Xiaoling Lu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Xiaobin Ma</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alexander Vaschillo</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Artyom Shaposhnikov</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Dmitry Vasilevsky</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>The TreeScape System: Reuse of Pre-Computed Aggregates over Irregular OLAP Hierarchies.</title><author><AuthorName>Torben Bach Pedersen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Christian S. Jensen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Curtis E. Dyreson</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>OLAP++: Powerful and Easy-to-Use Federations of OLAP and Object Databases.</title><author><AuthorName>Junmin Gu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Torben Bach Pedersen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Arie Shoshani</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Memex: A Browsing Assistant for Collaborative Archiving and Mining of Surf Trails.</title><author><AuthorName>Soumen Chakrabarti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sandeep Srivastava</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mallela Subramanyam</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Mitul Tiwari</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Building and Customizing Data-Intensive Web Sites Using Weave.</title><author><AuthorName>Khaled Yagoub</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Daniela Florescu</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Val{\'e}rie Issarny</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Patrick Valduriez</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Information Integration: The MOMIS Project Demonstration.</title><author><AuthorName>Domenico Beneventano</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Sonia Bergamaschi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Silvana Castano</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Alberto Corni</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>R. Guidetti</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>G. Malvezzi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Michele Melchiori</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Maurizio Vincini</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Telcordia's Database Reconciliation and Data Quality Analysis Tool.</title><author><AuthorName>Francesco Caruso</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Munir Cochinwala</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Uma Ganapathy</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Gail Lalk</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Paolo Missier</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>2000</year><conference>International Conference on Very Large Data Bases</conference><citation></citation><abstract></abstract></paper><paper><title>Rainbow: Distributed Database System for Classroom Education and Experimental Research.</title><auth