PODS A*

29 papers

YearTitle / Authors
2011A quest for beauty and wealth (or, business processes for database researchers).
Daniel Deutch, Tova Milo
2011A rule-based language for web data management.
Serge Abiteboul, Meghyn Bienvenu, Alban Galland, Émilien Antoine
2011Beyond simple aggregates: indexing for summary queries.
Zhewei Wei, Ke Yi
2011Data exchange beyond complete data.
Marcelo Arenas, Jorge Pérez, Juan L. Reutter
2011Determining relevance of accesses at runtime.
Michael Benedikt, Georg Gottlob, Pierre Senellart
2011Determining the currency of data.
Wenfei Fan, Floris Geerts, Jef Wijsen
2011Efficient evaluation for a temporal logic on changing XML documents.
Mikolaj Bojanczyk, Diego Figueira
2011FIFO indexes for decomposable problems.
Cheng Sheng, Yufei Tao
2011Finding a minimal tree pattern under neighborhood constraints.
Benny Kimelfeld, Yehoshua Sagiv
2011Get the most out of your sample: optimal unbiased estimators using partial information.
Edith Cohen, Haim Kaplan
2011Incomplete information and certain answers in general data models.
Leonid Libkin
2011Maximizing conjunctive views in deletion propagation.
Benny Kimelfeld, Jan Vondrák, Ryan Williams
2011New results on two-dimensional orthogonal range aggregation in external memory.
Cheng Sheng, Yufei Tao
2011On finding skylines in external memory.
Cheng Sheng, Yufei Tao
2011On provenance minimization.
Yael Amsterdamer, Daniel Deutch, Tova Milo, Val Tannen
2011On the complexity of privacy-preserving complex event processing.
Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Naughton
2011Pan-private algorithms via statistics on sketches.
Darakhshan J. Mir, S. Muthukrishnan, Aleksandar Nikolov, Rebecca N. Wright
2011Parallel evaluation of conjunctive queries.
Paraschos Koutris, Dan Suciu
2011Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12-16, 2011, Athens, Greece
Maurizio Lenzerini, Thomas Schwentick
2011Provenance for aggregate queries.
Yael Amsterdamer, Daniel Deutch, Val Tannen
2011Provenance views for module privacy.
Susan B. Davidson, Sanjeev Khanna, Tova Milo, Debmalya Panigrahi, Sudeepa Roy
2011Querying graph patterns.
Pablo Barceló, Leonid Libkin, Juan L. Reutter
2011Querying semantic web data with SPARQL.
Marcelo Arenas, Jorge Pérez
2011Relational transducers for declarative networking.
Tom J. Ameloot, Frank Neven, Jan Van den Bussche
2011Rewrite rules for search database systems.
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram Raghavan, Shivakumar Vaithyanathan
2011Space-efficient substring occurrence estimation.
Alessio Orlandi, Rossano Venturini
2011The complexity of text-preserving XML transformations.
Timos Antonopoulos, Wim Martens, Frank Neven
2011Theory of data stream computing: where to go.
S. Muthukrishnan
2011Tight bounds for Lp samplers, finding duplicates in streams, and related problems.
Hossein Jowhari, Mert Saglam, Gábor Tardos