Conferences in DBLP
Alon Y. Halevy , Michael J. Franklin , David Maier Principles of dataspace systems. [Citation Graph (0, 0)][DBLP ] Conf ] Mikolaj Bojanczyk , Claire David , Anca Muscholl , Thomas Schwentick , Luc Segoufin Two-variable logic on data trees and XML reasoning. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Haodong Hu An adaptive packed-memory array. [Citation Graph (0, 0)][DBLP ] Conf ] Phokion G. Kolaitis , Jonathan Panttaja , Wang Chiew Tan The complexity of data exchange. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Gottlob , Alan Nash Data exchange: computing cores in polynomial time. [Citation Graph (0, 0)][DBLP ] Conf ] Ronald Fagin Inverting schema mappings. [Citation Graph (0, 0)][DBLP ] Conf ] Leonid Libkin Data exchange and incomplete information. [Citation Graph (0, 0)][DBLP ] Conf ] Sara Cohen Equivalence of queries combining set and bag-set semantics. [Citation Graph (0, 0)][DBLP ] Conf ] T. S. Jayram , Phokion G. Kolaitis , Erik Vee The containment problem for REAL conjunctive queries with inequalities. [Citation Graph (0, 0)][DBLP ] Conf ] Alin Deutsch , Liying Sui , Victor Vianu , Dayou Zhou Verification of communicating data-driven web services. [Citation Graph (0, 0)][DBLP ] Conf ] Toon Calders , Stijn Dekeyser , Jan Hidders , Jan Paredaens Analyzing workflows implied by instance-dependent access rules. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph Y. Halpern From statistical knowledge bases to degrees of belief: an overview. [Citation Graph (0, 0)][DBLP ] Conf ] Solmaz Kolahi , Leonid Libkin On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Gottlob , Reinhard Pichler , Fang Wei Tractable database design through bounded treewidth. [Citation Graph (0, 0)][DBLP ] Conf ] Rajeev Motwani , Ying Xu 0002 Evolution of page popularity under random web graph models. [Citation Graph (0, 0)][DBLP ] Conf ] Nina Mishra , Mark Sandler Privacy via pseudorandom sketches. [Citation Graph (0, 0)][DBLP ] Conf ] Gagan Aggarwal , Tomás Feder , Krishnaram Kenthapadi , Samir Khuller , Rina Panigrahy , Dilys Thomas , An Zhu Achieving anonymity via clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Ashwin Machanavajjhala , Johannes Gehrke On the efficiency of checking perfect privacy. [Citation Graph (0, 0)][DBLP ] Conf ] Benny Kimelfeld , Yehoshua Sagiv Finding and approximating top-k answers in keyword proximity search. [Citation Graph (0, 0)][DBLP ] Conf ] Guizhen Yang , Michael Kifer , Vinay K. Chaudhri Efficiently ordering subgoals with access constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Anne Condon , Amol Deshpande , Lisa Hellerstein , Ning Wu Flow algorithms for two pipelined filter ordering problems. [Citation Graph (0, 0)][DBLP ] Conf ] Ashish Goel , Sudipto Guha , Kamesh Munagala Asking the right questions: model-driven optimization using probes. [Citation Graph (0, 0)][DBLP ] Conf ] Christoph Koch Processing queries on tree-structured data efficiently. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Pagh , Rasmus Pagh Scalable computation of acyclic joins. [Citation Graph (0, 0)][DBLP ] Conf ] Michael A. Bender , Martin Farach-Colton , Bradley C. Kuszmaul Cache-oblivious string B-trees. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grohe , André Hernich , Nicole Schweikardt Randomized computations on large data sets: tight lower bounds. [Citation Graph (0, 0)][DBLP ] Conf ] Luciana S. Buriol , Gereon Frahling , Stefano Leonardi , Alberto Marchetti-Spaccamela , Christian Sohler Counting triangles in data streams. [Citation Graph (0, 0)][DBLP ] Conf ] Graham Cormode , Flip Korn , S. Muthukrishnan , Divesh Srivastava Space- and time-efficient deterministic algorithms for biased quantiles over data streams. [Citation Graph (0, 0)][DBLP ] Conf ] Sudipto Guha , Andrew McGregor Approximate quantiles and the order of the stream. [Citation Graph (0, 0)][DBLP ] Conf ] Sumit Ganguly , Anirban Majumder Deterministic k-set structure. [Citation Graph (0, 0)][DBLP ] Conf ] L. K. Lee , H. F. Ting A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. [Citation Graph (0, 0)][DBLP ] Conf ] Qi Zhao , Mitsunori Ogihara , Haixun Wang , Jun Xu Finding global icebergs over distributed data sets. [Citation Graph (0, 0)][DBLP ] Conf ] Srinivas R. Kashyap , Supratim Deb , K. V. M. Naidu , Rajeev Rastogi , Anand Srinivasan Efficient gossip-based aggregate computation. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Gyssens , Jan Paredaens , Dirk Van Gucht , George H. L. Fletcher Structural characterizations of the semantics of XPath as navigation tool on a document. [Citation Graph (0, 0)][DBLP ] Conf ] Balder ten Cate The expressivity of XPath with transitive closure. [Citation Graph (0, 0)][DBLP ] Conf ] Aaron Bohannon , Benjamin C. Pierce , Jeffrey A. Vaughan Relational lenses: a language for updatable views. [Citation Graph (0, 0)][DBLP ] Conf ] Sreenivas Gollapudi , Ravi Kumar , D. Sivakumar Programmable clustering. [Citation Graph (0, 0)][DBLP ] Conf ] Enrico Franconi , Sergio Tessaris The logic of RDF and SPARQL: a tutorial. [Citation Graph (0, 0)][DBLP ] Conf ] Riccardo Rosati On the decidability and finite controllability of query processing in databases with incomplete information. [Citation Graph (0, 0)][DBLP ] Conf ] 