Michael Benedikt, Markus Krötzsch, Maurizio Lenzerini
Proceedings of the 31st Symposium on Principles of Database Systems
PODS, 2012.
@proceedings{PODS-2012, acmid = "2213556", address = " Scottsdale, Arizona, USA", editor = "Michael Benedikt and Markus Krötzsch and Maurizio Lenzerini", isbn = "978-1-4503-1248-6", publisher = "{ACM}", title = "{Proceedings of the 31st Symposium on Principles of Database Systems}", year = 2012, }
Contents (29 items)
- PODS-2012-Chaudhuri #big data #data transformation #research #what
- What next?: a half-dozen data management research goals for big data and the cloud (SC), pp. 1–4.
- PODS-2012-AhnGM #graph #sketching
- Graph sketches: sparsification, spanners, and subgraphs (KJA, SG, AM), pp. 5–14.
- PODS-2012-IndykLR #approximate #testing
- Approximating and testing k-histogram distributions in sub-linear time (PI, RL, RR), pp. 15–22.
- PODS-2012-AgarwalCHPWY #summary
- Mergeable summaries (PKA, GC, ZH, JMP, ZW, KY), pp. 23–34.
- PODS-2012-NgoPRR #algorithm #worst-case
- Worst-case optimal join algorithms: [extended abstract] (HQN, EP, CR, AR), pp. 37–48.
- PODS-2012-GrozMS #linear #regular expression
- Deterministic regular expressions in linear time (BG, SM, SS), pp. 49–60.
- PODS-2012-Pierce #bidirectional #tutorial
- Linguistic foundations for bidirectional transformations: invited tutorial (BCP), pp. 61–64.
- PODS-2012-ChoromanskiM #algorithm #database #graph #power of #privacy #statistics
- The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases (KC, TM), pp. 65–76.
- PODS-2012-KiferM #framework #privacy
- A rigorous and customizable framework for privacy (DK, AM), pp. 77–88.
- PODS-2012-LetelierPPS #optimisation #query #semantics #static analysis #web
- Static analysis and optimization of semantic web queries (AL, JP, RP, SS), pp. 89–100.
- PODS-2012-LosemannM #complexity
- The complexity of evaluating path expressions in SPARQL (KL, WM), pp. 101–112.
- PODS-2012-Nekrich #category theory
- Space-efficient range reporting for categorical data (YN), pp. 113–120.
- PODS-2012-ShengT #memory management
- Dynamic top-k range reporting in external memory (CS, YT), pp. 121–130.
- PODS-2012-Tao #2d #constant
- Indexability of 2D range search revisited: constant redundancy and weak indivisibility (YT), pp. 131–142.
- PODS-2012-Mahoney #approximate #data analysis #scalability
- Approximate computation and implicit regularization for very large-scale data analysis (MWM), pp. 143–154.
- PODS-2012-BorodinLY
- Max-Sum diversification, monotone submodular functions and dynamic updates (AB, HCL, YY), pp. 155–166.
- PODS-2012-KoutrisUBHS
- Query-based data pricing (PK, PU, MB, BH, DS), pp. 167–178.
- PODS-2012-FaginK #equivalence
- Local transformations and conjunctive-query equivalence (RF, PGK), pp. 179–190.
- PODS-2012-Kimelfeld #complexity #dependence #functional
- A dichotomy in the complexity of deletion propagation with functional dependencies (BK), pp. 191–202.
- PODS-2012-GrossiO #maintenance #sequence #string
- The wavelet trie: maintaining an indexed sequence of strings in compressed space (RG, GO), pp. 203–214.
- PODS-2012-XuT #clustering #on the
- On the optimality of clustering properties of space filling curves (PX, ST), pp. 215–224.
- PODS-2012-AgarwalESZ #nearest neighbour #nondeterminism
- Nearest-neighbor searching under uncertainty (PKA, AE, SS, WZ), pp. 225–236.
- PODS-2012-KostylevRS #classification #query
- Classification of annotation semirings over query containment (EVK, JLR, AZS), pp. 237–248.
- PODS-2012-BarceloLR #approximate #performance #query
- Efficient approximations of conjunctive queries (PB, LL, MR), pp. 249–260.
- PODS-2012-DengFG #complexity #on the #problem #recommendation
- On the complexity of package recommendation problems (TD, WF, FG), pp. 261–272.
- PODS-2012-McGregorPTW #estimation #statistics
- Space-efficient estimation of statistics over sub-sampled streams (AM, AP, ST, DPW), pp. 273–282.
- PODS-2012-TirthapuraW #data type
- Rectangle-efficient aggregation in spatial data streams (ST, DPW), pp. 283–294.
- PODS-2012-HuangYZ #algorithm #distributed #random
- Randomized algorithms for tracking distributed count, frequencies, and ranks (ZH, KY, QZ), pp. 295–306.
- PODS-2012-LiuRV #distributed
- Continuous distributed counting for non-monotonic streams (ZL, BR, MV), pp. 307–318.
3 ×#algorithm
3 ×#approximate
3 ×#complexity
3 ×#query
2 ×#distributed
2 ×#graph
2 ×#on the
2 ×#privacy
2 ×#statistics
3 ×#approximate
3 ×#complexity
3 ×#query
2 ×#distributed
2 ×#graph
2 ×#on the
2 ×#privacy
2 ×#statistics