Richard Hull, Martin Grohe
Proceedings of the 33rd Symposium on Principles of Database Systems
PODS, 2014.

@proceedings{PODS-2014,
	acmid         = "2594538",
	address       = "Snowbird, Utah, USA",
	editor        = "Richard Hull and Martin Grohe",
	isbn          = "978-1-4503-2375-8",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 33rd Symposium on Principles of Database Systems}",
	year          = 2014,
}

Contents (25 items)

8 ×#query
3 ×#database
2 ×#analysis
2 ×#independence
2 ×#information management
2 ×#question

PODS-2014-Libkin #how #semistructured data #what

Incomplete data: what went wrong, and how to fix it (LL), pp. 1–13.

PODS-2014-ArenasGP #query #semantics #web

Expressive languages for querying the semantic web (MA, GG, AP), pp. 14–26.

PODS-2014-GottlobRS

Expressiveness of guarded existential rule languages (GG, SR, MS), pp. 27–38.

PODS-2014-PichlerS #equivalence

Containment and equivalence of well-designed SPARQL (RP, SS), pp. 39–50.

PODS-2014-FanGL #big data #independence #on the #query

On scale independence for querying big data (WF, FG, LL), pp. 51–62.

PODS-2014-AmelootKNZ #declarative #fine-grained #network

Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture (TJA, BK, FN, DZ), pp. 64–75.

PODS-2014-Haas #challenge #ecosystem #roadmap #tool support

Model-data Ecosystems: challenges, tools, and trends (PJH), pp. 76–87.

PODS-2014-Cohen #analysis #graph #sketching

All-distances sketches, revisited: HIP estimators for massive graphs analysis (EC), pp. 88–99.

PODS-2014-IndykMMM #composition

Composable core-sets for diversity and coverage maximization (PI, SM, MM, VSM), pp. 100–108.

PODS-2014-PaghSW #question #set

Is min-wise hashing optimal for summarizing set intersection? (RP, MS, DPW), pp. 109–120.

PODS-2014-DurandSS #database #first-order #query

Enumerating answers to first-order queries over databases of low degree (AD, NS, LS), pp. 121–131.

PODS-2014-GrecoS #hybrid #query

Counting solutions to conjunctive queries: structural and hybrid tractability (GG, FS), pp. 132–143.

PODS-2014-FinkO #database #probability #query

A dichotomy for non-repeating queries with negation in probabilistic databases (RF, DO), pp. 144–155.

PODS-2014-Kimelfeld #database #information management

Database principles in information extraction (BK), pp. 156–163.

PODS-2014-FaginKRV #consistency #information management #nondeterminism

Cleaning inconsistencies in information extraction via prioritized repairs (RF, BK, FR, SV), pp. 164–175.

PODS-2014-KolaitisPSS #dependence #reasoning

Nested dependencies: structure and reasoning (PGK, RP, ES, VS), pp. 176–187.

PODS-2014-Barcelo0V #evaluation #query #question

Does query evaluation tractability help query containment? (PB, MR, MYV), pp. 188–199.

PODS-2014-BenediktCT #generative #low cost #proving

Generating low-cost plans from proofs (MB, BtC, ET), pp. 200–211.

PODS-2014-BeameKS #parallel #query

Skew in parallel query processing (PB, PK, DS), pp. 212–223.

PODS-2014-PaghS #complexity

The input/output complexity of triangle enumeration (RP, FS), pp. 224–233.

PODS-2014-NgoNRR #analysis #worst-case

Beyond worst-case analysis for joins with minesweeper (HQN, DTN, CR, AR), pp. 234–245.

PODS-2014-HuQT #independence

Independent range sampling (XH, MQ, YT), pp. 246–255.

PODS-2014-Tao

A dynamic I/O-efficient structure for one-dimensional top-k range reporting (YT), pp. 256–265.

PODS-2014-PatilTSNV #category theory #query

Categorical range maxima queries (MP, SVT, RS, YN, JSV), pp. 266–277.

PODS-2014-BenderFFFG

Cost-oblivious storage reallocation (MAB, MFC, SPF, JTF, SG), pp. 278–288.