Leonid Libkin
Proceedings of the 26th Symposium on Principles of Database Systems
PODS, 2007.

@proceedings{PODS-2007,
	acmid         = "1265530",
	address       = "Beijing, China",
	editor        = "Leonid Libkin",
	isbn          = "978-1-59593-685-1",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 26th Symposium on Principles of Database Systems}",
	year          = 2007,
}

Contents (31 items)

9 ×#query
5 ×#probability
5 ×#xml
4 ×#complexity
2 ×#bound
2 ×#data type
2 ×#multi
2 ×#on the
2 ×#reasoning
2 ×#transducer

PODS-2007-DalviS #challenge #probability

Management of probabilistic data: foundations and challenges (NND, DS), pp. 1–12.

PODS-2007-GottlobMS #np-hard

Generalized hypertree decompositions: np-hardness and tractable variants (GG, ZM, TS), pp. 13–22.

PODS-2007-Marx #query

Queries determined by views: pack your views (MM), pp. 23–30.

PODS-2007-GreenKT

Provenance semirings (TJG, GK, VT), pp. 31–40.

PODS-2007-Schweikardt #bound #modelling #query

Machine models and lower bounds for query processing (NS), pp. 41–52.

PODS-2007-ChakaravarthyPRAM #algorithm #approximate #identification

Decision trees for entity identification: approximation algorithms and hardness results (VTC, VP, SR, PA, MKM), pp. 53–62.

PODS-2007-EngelfrietHS #transducer #xml

XML transformation by tree-walking transducers with invisible pebbles (JE, HJH, BS), pp. 63–72.

PODS-2007-CateL #complexity #query #xpath

The complexity of query containment in expressive fragments of XPath 2.0 (BtC, CL), pp. 73–82.

PODS-2007-FanGN #complexity #transducer #xml

Expressiveness and complexity of xml publishing transducers (WF, FG, FN), pp. 83–92.

PODS-2007-GemullaLH #evolution #maintenance #multi

Maintaining bernoulli samples over evolving multisets (RG, WL, PJH), pp. 93–102.

PODS-2007-ChierichettiPRSTU #clustering

Finding near neighbors through cluster pruning (FC, AP, PR, MS, AT, EU), pp. 103–112.

PODS-2007-HernichS #dependence

CWA-solutions for data exchange settings with target dependencies (AH, NS), pp. 113–122.

PODS-2007-FaginKPT

Quasi-inverses of schema mappings (RF, PGK, LP, WCT), pp. 123–132.

PODS-2007-GiacomoLLR #data transformation #integration #on the

On reconciling data exchange, data integration, and peer data management (GDG, DL, ML, RR), pp. 133–142.

PODS-2007-BusscheGV #database #query

A crash course on database queries (JVdB, DVG, SV), pp. 143–154.

PODS-2007-KasneciS #complexity #reasoning #xml

The complexity of reasoning about pattern-based XML schemas (GK, TS), pp. 155–164.

PODS-2007-GottlobPW #bound #datalog #finite #monad

Monadic datalog over finite structures with bounded treewidth (GG, RP, FW), pp. 165–174.

PODS-2007-Machlin #array #equivalence #multi #query #safety

Index-based multidimensional array queries: safety and equivalence (RM), pp. 175–184.

PODS-2007-BadiaV #query

Non-linear prefixes in query languages (AB, SV), pp. 185–194.

PODS-2007-CautisAM #constraints #reasoning #xml

Reasoning about XML update constraints (BC, SA, TM), pp. 195–204.

PODS-2007-FiliotNTT #polynomial #xpath

Polynomial time fragments of XPath with variables (EF, JN, JMT, ST), pp. 205–214.

PODS-2007-MunagalaSW #optimisation #query

Optimization of continuous queries with shared expensive filters (KM, US, JW), pp. 215–224.

PODS-2007-ZhangG #estimation

Variance estimation over sliding windows (LZ, YG), pp. 225–232.

PODS-2007-Alur #word

Marrying words and trees (RA), pp. 233–242.

PODS-2007-JayramMMV #data type #probability #statistics

Estimating statistical aggregates on probabilistic data streams (TSJ, AM, SM, EV), pp. 243–252.

PODS-2007-CohenDKLT #data type #query #sketching

Sketching unaggregated data streams for subpopulation-size queries (EC, NGD, HK, CL, MT), pp. 253–262.

PODS-2007-WhiteRGD #question #what

What is “next” in event processing? (WMW, MR, JG, AJD), pp. 263–272.

PODS-2007-BarakCDKMT #consistency #privacy

Privacy, accuracy, and consistency too: a holistic solution to contingency table release (BB, KC, CD, SK, FM, KT), pp. 273–282.

PODS-2007-SenellartA #complexity #on the #probability #xml

On the complexity of managing probabilistic XML data (PS, SA), pp. 283–292.

PODS-2007-DalviS07a #probability #query

The dichotomy of conjunctive queries on probabilistic structures (NND, DS), pp. 293–302.

PODS-2007-KimelfeldS #probability

Maximally joining probabilistic data (BK, YS), pp. 303–312.