Maurizio Lenzerini, Thomas Schwentick
Proceedings of the 30th Symposium on Principles of Database Systems
PODS, 2011.

@proceedings{PODS-2011,
	acmid         = "1989284",
	address       = "Athens, Greece",
	editor        = "Maurizio Lenzerini and Thomas Schwentick",
	isbn          = "978-1-4503-0660-7",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 30th Symposium on Principles of Database Systems}",
	year          = 2011,
}

Contents (28 items)

5 ×#query
3 ×#on the
2 ×#complexity
2 ×#database
2 ×#evaluation
2 ×#memory management
2 ×#privacy
2 ×#problem
2 ×#web
2 ×#xml

PODS-2011-DeutchM #database #process #research

A quest for beauty and wealth (or, business processes for database researchers) (DD, TM), pp. 1–12.

PODS-2011-CohenK #using

Get the most out of your sample: optimal unbiased estimators using partial information (EC, HK), pp. 13–24.

PODS-2011-ShengT #problem

FIFO indexes for decomposable problems (CS, YT), pp. 25–35.

PODS-2011-MirMNW #algorithm #sketching #statistics

Pan-private algorithms via statistics on sketches (DJM, SM, AN, RNW), pp. 37–48.

PODS-2011-JowhariST #bound #problem

Tight bounds for Lp samplers, finding duplicates in streams, and related problems (HJ, MS, GT), pp. 49–58.

PODS-2011-Libkin #modelling

Incomplete information and certain answers in general data models (LL), pp. 59–70.

PODS-2011-FanGW

Determining the currency of data (WF, FG, JW), pp. 71–82.

PODS-2011-ArenasPR

Data exchange beyond complete data (MA, JP, JLR), pp. 83–94.

PODS-2011-OrlandiV #estimation #string

Space-efficient substring occurrence estimation (AO, RV), pp. 95–106.

PODS-2011-ShengT11a #memory management #on the

On finding skylines in external memory (CS, YT), pp. 107–116.

PODS-2011-WeiY #query #summary

Beyond simple aggregates: indexing for summary queries (ZW, KY), pp. 117–128.

PODS-2011-ShengT11b #2d #memory management #orthogonal

New results on two-dimensional orthogonal range aggregation in external memory (CS, YT), pp. 129–139.

PODS-2011-AmsterdamerDMT #on the

On provenance minimization (YA, DD, TM, VT), pp. 141–152.

PODS-2011-AmsterdamerDT #query

Provenance for aggregate queries (YA, DD, VT), pp. 153–164.

PODS-2011-HeBWN #complexity #on the #privacy

On the complexity of privacy-preserving complex event processing (YH, SB, DW, JFN), pp. 165–174.

PODS-2011-DavidsonKMPR #privacy

Provenance views for module privacy (SBD, SK, TM, DP, SR), pp. 175–186.

PODS-2011-KimelfeldVW

Maximizing conjunctive views in deletion propagation (BK, JV, RW), pp. 187–198.

PODS-2011-BarceloLR #graph #query

Querying graph patterns (PB, LL, JLR), pp. 199–210.

PODS-2011-BenediktGS #runtime

Determining relevance of accesses at runtime (MB, GG, PS), pp. 211–222.

PODS-2011-KoutrisS #evaluation #parallel #query

Parallel evaluation of conjunctive queries (PK, DS), pp. 223–234.

PODS-2011-KimelfeldS #constraints

Finding a minimal tree pattern under neighborhood constraints (BK, YS), pp. 235–246.

PODS-2011-AntonopoulosMN #complexity #xml

The complexity of text-preserving XML transformations (TA, WM, FN), pp. 247–258.

PODS-2011-BojanczykF #documentation #evaluation #logic #performance #xml

Efficient evaluation for a temporal logic on changing XML documents (MB, DF), pp. 259–270.

PODS-2011-FaginKLRV #database

Rewrite rules for search database systems (RF, BK, YL, SR, SV), pp. 271–282.

PODS-2011-AmelootNB #declarative #network #relational #transducer

Relational transducers for declarative networking (TJA, FN, JVdB), pp. 283–292.

PODS-2011-AbiteboulBGA #data transformation #rule-based #web

A rule-based language for web data management (SA, MB, AG, ÉA), pp. 293–304.

PODS-2011-ArenasP #query #semantics #web

Querying semantic web data with SPARQL (MA, JP), pp. 305–316.

PODS-2011-Muthukrishnan #data type

Theory of data stream computing: where to go (SM), pp. 317–319.