Here Are Some Tips for You to Conduct a Survey and Make a Proper Report. the Report Should

RESEARCH

Here are some tips for you to conduct a survey and make a proper report. The report should have 2 equally important tasks: 1) integrated summary of the current research on the selected topics (they are facts collected from the public domain) and 2) your injected opinion and suggestion as well as your comments about the current results. Hence in your report you should include 50% of the fact and other 50% for your opinion.

Recently, I download many papers about “material views”. These papers are still in EA1214, first station of the second row from the centre of the lab. They are in the GS tools, under the names of the authors or under p3, p7, etc. You are able to locate them by “find” command from the “start” in desktop window.

Material views: During your reading on this subject, you might focus on the following questions and try to see how the papers address the answers:

1. Given a query and a set of views. Find some views which are used to replace some base tables from the query with a better cost. 2. Given a query. Can you derive ALL possible views that are suitable for the better lower-cost for the rewritten equivalences? 3. Imagine that there are quite a few queries are executed daily. Is that possible to find a common view (or a set of common views) for most of the daily used queries? This problem might lead to statistical analysis as well as the area of artificial intelligence.

Being a member of ACM digital library, you are able to access: VLDB, Sigmod, and SigPod. Including below is the list of papers from the Sigmod ‘2000.

2000 Sigmod

RESEARCH SESSIONS

Session: Data Mining I

Mining Frequent Patterns without Candidate Generation

Jiawei Han, Jian Pei, Yiwen Yin ... Paper

Data Mining on an OLTP System (Nearly) for Free

Erik Riedel, Christos Faloutsos, Greg Ganger, David Nagle ... Paper

Turbo-charging Vertical Mining of Large Databases Pradeep Shenoy, Jayant Haritsa, S. Sudarshan,Gaurav Bhalotia, Mayank Bawa, Devavrat Shah ... Paper

Session: Recovery, Restaring, Reorganizing

High Speed On-line Backup When Using Logical Log Operations

David Lomet ... Paper

Efficient Resumption of Interrupted Warehouse Loads

Wilburt Labio, Janet Wiener, Hector Garcia-Molina, Vlad Gorelik ... Paper

On-line Reorganization in Object Databases

Mohana Krishna Lakhamraju, Rajeev Rastogi, S. Seshadri, S. Sudarshan ... Paper

Session: Clustering

Finding Generalized Projected Clusters In High Dimensional Spaces

Charu Aggrawal, Philip Yu ... Paper

Density Biased Sampling: An Improved Method for Data Mining and Clustering

Christopher Palmer, Christos Faloutsos ... Paper

LOF: Identifying Density-Based Local Outliers

Markus Breunig, Hans-Peter Kriegel, Raymond Ng, Joerg Sander ... Paper

Session: Materialized Views and Consistency

Answering Complex SQL Queries Using Automatic Summary Tables

Markos Zaharioudakis, Roberta Cochrane, George Lapis, Hamid Pirahesh, Monica Urata ... Paper

Synchronizing a database to Improve Freshness

Junghoo Cho, Hector Garcia-Molina ... Paper

How to Roll a Join: Asynchonous Incremental View Maintenance

Kenneth Salem, Kevin Beyer, Roberta cochrane, Bruce Lindsay ... Paper

Session: XML

On Wrapping Query Languages and Efficient XML Integration

Vassilis Christophides, Sophie Cluet, Jerome Simeon ... Paper XMILL: An efficient Compressor for XML Data

Hartmut Liefke, Dan Suciu ... Paper

XTRACT: A System for Extracting Document Type Descriptors from XML Documents

Minos Garofalakis, Aristides Gionis, Rajeev Rastogi, S. Seshadri, Kyuseok Shim ... Paper

Session: Nearest Neighbor/Spatial Joins

Spatial Join Selectivity Using Power Laws

Christos Faloutsos, Bernhard Seeger, Agma Traina, Caetano Traina ... Paper

Closest Pair Queries In Spatial Databases

Antonio Coral, Yannis Manolopoulos, Yannis Theodoridis, Michael Vassilakopoulos ... Paper

Influence Sets Based on Reverse Nearest Neighbor Queries

Flip Korn, S. Muthukrishnan ... Paper

Session: Distributed and Parallel Systems

MOCHA: A Self-Extensible Database Middleware System for Distributed Data sources

Manuel Rodriguez, Nick Roussopoulos ... Paper

Towards Self-Tuning Data Placement in Parallel Database Systems

Mong Li Lee, Masaru Kisturegawa, Beng Chin Ooi, Kian-Lee Tan, Anirban Mondal ... Paper

LH*RS: A High-Availability Scalable Distributed Data Structure Using Reed Solomon Codes

Witold Litwin, Thomas Schwarz ... Paper

Session: Query Optimization

Efficient Algorithms for Multi Query Optimization

Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bhobe ... Paper

Eddies: Continuously Adaptive Query Processing

Joseph M. Hellerstein, Ron Avnur ... Paper

A Chase Too Far?

Lucian Popa, Alin Deutsch, Arnaud Sahuguet, Val Tannen ... Paper Session: Internet Applications

WSQ/DSQ: A Practical Approach for Combined Querying of Databases and the Web

Roy Goldman, Jennifer Widom ... Paper

A Framework For Expressing and Combining Preferences

Rakesh Agrawal, Edward Wimmers ... Paper

TerraServer: A Spatial Data Warehouse

Tim Barclay, Don Slutz, Jim Gray... Paper

Session: Moving Objects and Distance Joins

A Data Model and Data Structures for Moving Objects Databases

Luca Forlizzi, Ralf Hartmut Güting, Enrico Nardelli, Markus Schneider ... Paper

Indexing the Positions of Continuously Moving Objects

Simonas Saltenis, Christian S. Jensen, Scott T. Leutenegger, Mario A. Lopez ... Paper

Adaptive Multi-Stage Distance Join Processing

Bongki Moon, Hyoseop Shin, Sukho Lee ... Paper

Session: Web and Internet

Finding Replicated Web Collections

Junghoo Cho, Narayanan Shivakumar, Hector Garcia-Molina ... Paper

WebView materialization

Alexandros Labrinidis, Nick Roussopoulos ... Paper

NiagaraCQ: A scalable continuous Query System for Internet databases

Jianjun Chen, David DeWitt, Feng Tian, Yuan Wang ... Paper

Session: Indexing

The Onion Technique: Indexing for Linear Optimization Queries

Yuan-Chi Chang, Lawrence Bergman, Vittorio Castelli, Chung-Sheng Li, Ming-Ling Lo, John R. Smith ... Paper

On Effective Multi-Dimensional Indexing For Strings H. V. Jagadish, Nick Koudas, Divesh Srivastava ... Paper

Efficient Browsing Indexing and Querying for Large Video Database Management Systems

JungHwan Oh, Kien Hua, Kiran Prabhakara ... Paper

Session: Data Mining II

Efficient Algorithms for Mining Outliers from Large Data sets

Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim ... Paper

Privacy-Preserving Data Mining

Rakesh Agrawal, Ramakrishnan Srikant ... Paper

Designing and Mining Multi-terabyte Astronomy Archives

Alexander Szalay, Jim Gray, Peter Kunszt, Ani Thakar ... Paper

Session: Query Evaluation

Approximating multi-dimensional aggregate range queries over real attributes

Dimitrios Gunopoulos, George Kollios, Vassilis Tsotras, Carlotta Domeniconi ... Paper

Making B+-trees Cache Conscious in Main Memory

Jun Rao, Kenneth Ross ... Paper

Congressional Samples for Approximate Answering of Group-By Queries

Swarup Acharya, Phillip Gibbons, Wiswanath Poosala ... Paper

2000PODS Session 1: PODS Invited Talk

 The Web as a Graph. Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins (IBM Almaden), and Eli Upfal (Brown University) [.ps.gz] [.pdf] Session 2: XML Technology

 Typechecking for XML Transformers. Tova Milo (Tel Aviv University), Dan Suciu (AT&T Labs), and Victor Vianu (UC San Diego) [.ps.gz] [.pdf]  Integrity Constraints for XML. Wenfei Fan (Temple University), and Jérôme Siméon (Bell Labs) [.ps.gz] [.pdf]  DTD Inference for Views of XML Data. Yannis Papakonstantinou (UC San Diego), and Victor Vianu (UC San Diego) [.ps.gz] [.pdf] Session 3: Views / Query Containment

 On the Content of Materialized Aggregate Views. Stéphane Grumbach (INRIA), and Leonardo Tininini (CNR-IASI, Rome) [.ps.gz] [.pdf]  View-Based Query Processing for Regular Path Queries with Inverse. Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini (Università di Roma ``La Sapienza''), and Moshe Y. Vardi (Rice University) [.ps.gz] [.pdf]  Query Containment for Data Integration Systems. Todd Millstein, Alon Levy (University of Washington), and Marc Friedman (Viathan Corporation) [.ps.gz] [.pdf] Session 4: PODS Invited Tutorial

 Constraint Satisfaction in Database Theory. Moshe Vardi (Rice University) [.ps.gz] [.pdf] Session 5: Award Talks

 Auditing Boolean Attributes. Jon Kleinberg (Cornell University), Christos Papadimitriou (UC Berkeley), and Prabhakar Raghavan (IBM Almaden) [.ps.gz] [.pdf]  Verification of Relational Transducers for Electronic Commerce. Marc Spielmann (RWTH Aachen) [.ps.gz] [.pdf] Session 6: Spatial and Constraint Databases

 Reachability and Connectivity Queries in Constraint Databases. Michael Benedikt (Bell Labs), Martin Grohe (Universität Freiburg), Leonid Libkin (Bell Labs), and Luc Segoufin (INRIA) [.ps.gz] [.pdf]  Fixed-Point Query Languages for Linear Constraint Databases. Stephan Kreutzer (RWTH Aachen) [.ps.gz] [.pdf]  Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic. Floris Geerts, and Bart Kuijpers (Limburgs Universitair Centrum) [.ps.gz] [.pdf] Session 7: Semistructured Data

 Computational Aspects of Resilient Data Extraction from Semistructured Sources. Hasan Davulcu, Guizhen Yang, Michael Kifer, and I.V. Ramakrishnan (SUNY at Stony Brook) [.ps.gz] [.pdf]  Expressive and Efficient Pattern Languages for Tree-Structured Data. Frank Neven (Limburgs Universitair Centrum), and Thomas Schwentick (Universität Mainz) [.ps.gz] [.pdf]  Expressive Power and Data Complexity of Query Languages for Trees and Lists. Evgeny Dantsin (University of Manchester), and Andrei Voronkov (University of Manchester) [.ps.gz] [.pdf] Session 8: Indexing / Transactions

 Indexing the Edges -- A Simple and yet Efficient Approach to High-Dimensional Indexing. Beng Chin Ooi, Kian-Lee Tan, Cui Yu, and Stéphane Bressan (National University of Singapore) [.ps.gz] [.pdf]  Indexing Moving Points. Pankaj K. Agarwal (Duke University), Lars Arge (Duke University), and Jeff Erickson (University of Illinois) [.ps.gz] [.pdf]  On Herbrand Semantics and Conflict Serializability of Read-Write Transactions. Jens Lechtenbörger, and Gottfried Vossen (Universität Münster) [.ps.gz] [.pdf] Session 9: Invited Tutorial

 Entrepreneurship for Information Systems Researchers. Ashish Gupta (Amazon.com) [.ps.gz] [.pdf] Session 10: Range Queries / Selectivity Estimation

 Optimal Histograms for Hierarchical Range Queries. Nick Koudas, S. Muthukrishnan, and Divesh Srivastava (AT&T Labs) [.ps.gz] [.pdf]  (Almost) Optimal Parallel Block Access for Range Queries. Mikhail J. Atallah (CERIAS and Purdue University), Sunil Prabhakar (Purdue University) [.pdf]  Selectivity Estimation for Boolean Queries. Zhiyuan Chen (Cornell University), Flip Korn (AT&T Labs), Nick Koudas (AT&T Labs), and S. Muthukrishnan (AT&T Labs) [.ps.gz] [.pdf] Session 11: Data Mining / Information Dependencies

 Traversing Itemset Lattices with Statistical Metric Pruning. Shinichi Morishita (University of Tokyo), and Jun Sese (University of Tokyo) [.pdf]  Computational Properties of Metaquerying Problems. Fabrizio Angiulli (Università della Calabria), Rachel Ben-Eliyahu-Zohary (Ben-Gurion University), Giovambattista Ianni (Università della Calabria), and Luigi Palopoli (Università della Calabria) [.ps.gz] [.pdf]  Information Dependencies. Mehmet M. Dalkilic (Indiana University), and Edward L. Robertson (Indiana University) [.ps.gz] [.pdf] Session 12: Sampling  Uniform Generation in Spatial Constraint Databases and Applications. David Gross (Université Paris-Sud), and Michel De Rougemont (Université Paris II) [.ps.gz] [.pdf]  Analysis and Application of Adaptive Sampling. James F. Lynch (Clarkson University) [.ps.gz] [.pdf]  Towards Estimation Error Guarantees for Distinct Values. Moses Charikar (Stanford University), Surajit Chaudhuri (Microsoft Research), Rajeev Motwani (Stanford University), and Vivek Narasayya (Microsoft Research) [.ps.gz] [.pdf]