Finding Global Icebergs over Distributed Data Sets
Qi Zhao, Mitsunori Ogihara (Rochester),
Haixun Wang (IBM),
Jun Xu (Georgia Tech)
Asking the right questions: Model-driven optimization using probes
Ashish Goel (Stanford),
Sudipto Guha (UPenn),
Kamesh Munagala (Duke)
Achieving Anonymity via Clustering in a Metric Space
Gagan Aggarwal (Google),
Tomas Feder, Krishnaram Kenthapadi,
Rina Panigrahy, Dilys Thomas (Stanford),
An Zhu (Google)
Efficiently Ordering Subgoals with Access Constraints
Guizhen Yang, Vinay K. Chaudhri (SRI),
Michael Kifer (Stony Brook)
Privacy via Pseudorandom Sketches
Nina Mishra (University of Virginia),
Mark Sandler (Cornell)
Evolution of Page Popularity under Random Web Graph Models
Rajeev Motwani,
Ying Xu (Stanford)
On the Efficiency of Checking Perfect Privacy
Ashwin Machanavajjhala, Johannes Gehrke (Cornell)
Inverting schema mappings
Ronald Fagin (IBM)
Data Exchange and Incomplete Information
Leonid Libkin (Toronto)
On Redundancy vs Dependency Preservation in Normalization: An
Information-Theoretic Study of 3NF
Solmaz Kolahi, Leonid Libkin (Toronto)
Efficient Gossip-Based Aggregate Computation
Srinivas Kashyap (University of Maryland),
Supratim Deb, K.V.M. Naidu,
Rajeev Rastogi, Anand Srinivasan (Bell Labs)
Equivalence of Queries Combining Set and Bag-Set Semantics
Sara Cohen (Technion)
Scalable computation of acyclic joins
Anna Pagh, Rasmus Pagh (IT University of Copenhagen)
Two-Variable Logic on Data Trees and XML Reasoning
Mikolaj Bojanczyk (Warsaw University),
Claire David,
Anca Muscholl (University of Paris 7),
Thomas Schwentick (University of Dortmund),
Luc Segoufin (INRIA)
Approximate Quantiles and the Order of the Stream
Sudipto Guha, Andrew McGregor (UPenn)
Structural Characterizations of the Semantics of XPath as Navigation Tool on a
Document
Marc Gyssens (Hasselt University),
Jan Paredaens (University of Antwerp),
Dirk Van Gucht, George Fletcher (Indiana University)
Data Exchange: Computing Cores in Polynomial Time
Georg Gottlob (TU Wien),
Alan Nash (UCSD)
An Adaptive Packed-Memory Array
Michael Bender, Haodong Hu (Stony Brook)
On the decidability and finite controllability of query processing in
databases with incomplete information
Riccardo Rosati (University of Rome La Sapienza)
Counting Triangles in Data Streams
Luciano Buriol (Universidade Federal de Santa Maria),
Gereon Frahling (University of Paderborn),
Stefano Leonardi,
Alberto Marchetti-Spaccamela (University of Rome La Sapienza)
Christian Sohler (University of Paderborn)
Randomized Computations on Large Data Sets: Tight Lower Bounds
Martin Grohe, Andre Hernich,
Nicole Schweikardt (Humboldt-University Berlin)
Analyzing workflows implied by instance-dependent access rules
Toon Calders (University of Antwerp),
Stijn Dekeyser (University Southern Queensland),
Jan Hidders, Jan Paredaens (University of Antwerp)
Deterministic k-set structure
Sumit Ganguly, Anirban Majumder (IIT Kanpur)
Tractable Database Design and Datalog Abduction through Bounded Treewidth
Georg Gottlob, Reinhard Pichler, Fang Wei (TU Wien)
Finding and Approximating Top-k Answers in Keyword Proximity Search
Benny Kimelfeld, Shuky Sagiv (Hebrew University)
The Complexity of Data Exchange
Phokion Kolaitis (IBM), Jonathan Panttaja, Wang-Chiew Tan (UCSC)
The expressivity of XPath with transitive closure
Balder ten Cate (Universiteit van Amsterdam)
The Containment Problem for "Real" Conjunctive Queries with Inequalities
T.S. Jayram, Phokion Kolaitis, Erik Vee (IBM)
Flow Algorithms for Two Pipelined Filter Ordering Problems
Anne Condon (UBC),
Amol Deshpande, (University of Maryland),
Lisa Hellerstein, Ning Wu (Polytechnic University)
Space- and Time-Efficient Deterministic Algorithms for Biased Quantiles over
Data Streams
Graham Cormode (Bell Labs),
Flip Korn, S. Muthukrishnan,
Divesh Srivastava (AT&T Research)
Programmable Clustering
Sreenivas Gollapudi (Ebrary),
Ravi Kumar (Yahoo!),
D. Sivakumar (Google)
Verification of Communicating Data-Driven Web Services
Alin Deutsch, Liying Sui, Victor Vianu, Dayou Zhou (UCSD)
Cache-Oblivious String B-trees
Michael Bender (Stony Brook),
Martin Farach-Colton (Rutgers),
Bradley Kuszmaul (MIT)
A simpler and more efficient deterministic scheme for finding frequent items
over sliding windows
L.K. Lee, H.F. Ting (University of Hong Kong)
Relational Lenses: A Language for Updatable Views
Aaron Bohannon, Benjamin Pierce, Jeffrey A. Vaughan (UPenn)