Richard Hull, Wenfei Fan
Proceedings of the 32nd Symposium on Principles of Database Systems
PODS, 2013.

@proceedings{PODS-2013,
	acmid         = "2463664",
	address       = "New York, New York, USA",
	editor        = "Richard Hull and Wenfei Fan",
	isbn          = "978-1-4503-2066-5",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 32nd Symposium on Principles of Database Systems}",
	year          = 2013,
}

Contents (27 items)

9 ×#query
4 ×#graph
3 ×#database
3 ×#on the
3 ×#verification
2 ×#complexity
2 ×#data access
2 ×#datalog
2 ×#ontology
2 ×#power of

PODS-2013-CalvaneseGM #analysis #database #perspective #process

Foundations of data-aware process analysis: a database theory perspective (DC, GDG, MM), pp. 1–12.

PODS-2013-KimelfeldK #complexity #mining

The complexity of mining maximal frequent subgraphs (BK, PGK), pp. 13–24.

PODS-2013-Gottlob #identification #polynomial

Deciding monotone duality and identifying frequent itemsets in quadratic logspace (GG), pp. 25–36.

PODS-2013-FaginKRV #framework #information management #named

Spanners: a formal framework for information extraction (RF, BK, FR, SV), pp. 37–48.

PODS-2013-AbouziedAPHS #learning #quantifier #query #verification

Learning and verifying quantified boolean queries by example (AA, DA, CHP, JMH, AS), pp. 49–60.

PODS-2013-BojanczykST #verification

Verification of database-driven systems via amalgamation (MB, LS, ST), pp. 63–74.

PODS-2013-GheerbrantLS #evaluation #question

When is naive evaluation possible? (AG, LL, CS), pp. 75–86.

PODS-2013-Indyk #fourier #sketching

Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform (PI), pp. 87–90.

PODS-2013-AbiteboulV #collaboration #data-driven #workflow

Collaborative data-driven workflows: think global, act local (SA, VV), pp. 91–102.

PODS-2013-Kejlberg-RasmussenTTTY

I/O-efficient planar range skyline and attrition priority queues (CKR, YT, KT, KT, JY), pp. 103–114.

PODS-2013-AgarwalAHPYZ #nearest neighbour #nondeterminism

Nearest neighbor searching under uncertainty II (PKA, BA, SHP, JMP, KY, WZ), pp. 115–126.

PODS-2013-GogaczM #on the

On the BDD/FC conjecture (TG, JM), pp. 127–138.

PODS-2013-AmelootBW #on the #power of

On the expressive power of update primitives (TJA, JVdB, EW), pp. 139–150.

PODS-2013-RudolphK #data access #query

Flag & check: data access with monadically defined queries (SR, MK), pp. 151–162.

PODS-2013-HaririCGDM #relational #verification

Verification of relational data-centric dynamic systems with external services (BBH, DC, GDG, AD, MM), pp. 163–174.

PODS-2013-Baeza #database #graph #query

Querying graph databases (PBB), pp. 175–188.

PODS-2013-Wijsen #query

Charting the tractability frontier of certain conjunctive query answering (JW), pp. 189–200.

PODS-2013-LibkinRV #adaptation #graph #query #rdf

Trial for RDF: adapting graph query languages for RDF data (LL, JLR, DV), pp. 201–212.

PODS-2013-BienvenuCLW #case study #csp #data access #datalog #ontology

Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP (MB, BtC, CL, FW), pp. 213–224.

PODS-2013-HernichKLG #datalog #ontology #reasoning #semantics

Well-founded semantics for extended datalog and ontological reasoning (AH, CK, TL, GG), pp. 225–236.

PODS-2013-BaezaRV #database #graph #semantics

Semantic acyclicity on graph databases (PBB, MR, MYV), pp. 237–248.

PODS-2013-Figueira #on the #testing #transitive #xpath

On XPath with transitive axes and data tests (DF), pp. 249–260.

PODS-2013-BaganBG #graph #query

A trichotomy for regular simple path queries on graphs (GB, AB, BG), pp. 261–272.

PODS-2013-BeameKS #communication #parallel #query

Communication steps for parallel query processing (PB, PK, DS), pp. 273–284.

PODS-2013-Wong #calculus #power of #relational #set

A dichotomy in the intensional expressive power of nested relational calculi augmented with aggregate functions and a powerset operator (LW), pp. 285–296.

PODS-2013-KazanaS #bound #first-order #query

Enumeration of first-order queries on classes of structures with bounded expansion (WK, LS), pp. 297–308.

PODS-2013-ChenM #classification #complexity #query

The fine classification of conjunctive queries and parameterized logarithmic space complexity (HC, MM), pp. 309–320.