Stijn Vansummeren
Proceedings of the 25th Symposium on Principles of Database Systems
PODS, 2006.

@proceedings{PODS-2006,
	acmid         = "1142351",
	address       = "Chicago, Illinois, USA",
	editor        = "Stijn Vansummeren",
	isbn          = "1-59593-318-2",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 25th Symposium on Principles of Database Systems}",
	year          = 2006,
}

Contents (39 items)

4 ×#query
3 ×#on the
3 ×#performance
3 ×#set
2 ×#algorithm
2 ×#approximate
2 ×#bound
2 ×#clustering
2 ×#data type
2 ×#database

PODS-2006-HalevyFM

Principles of dataspace systems (AYH, MJF, DM), pp. 1–9.

PODS-2006-BojanczykDMSS #logic #reasoning #xml

Two-variable logic on data trees and XML reasoning (MB, CD, AM, TS, LS), pp. 10–19.

PODS-2006-BenderH #adaptation #array

An adaptive packed-memory array (MAB, HH), pp. 20–29.

PODS-2006-KolaitisPT #complexity

The complexity of data exchange (PGK, JP, WCT), pp. 30–39.

PODS-2006-GottlobN #polynomial

Data exchange: computing cores in polynomial time (GG, AN), pp. 40–49.

PODS-2006-Fagin

Inverting schema mappings (RF), pp. 50–59.

PODS-2006-Libkin

Data exchange and incomplete information (LL), pp. 60–69.

PODS-2006-Cohen #equivalence #query #semantics #set

Equivalence of queries combining set and bag-set semantics (SC), pp. 70–79.

PODS-2006-JayramKV #problem #query

The containment problem for REAL conjunctive queries with inequalities (TSJ, PGK, EV), pp. 80–89.

PODS-2006-DeutschSVZ #communication #data-driven #verification #web #web service

Verification of communicating data-driven web services (AD, LS, VV, DZ), pp. 90–99.

PODS-2006-CaldersDHP #workflow

Analyzing workflows implied by instance-dependent access rules (TC, SD, JH, JP), pp. 100–109.

PODS-2006-Halpern #knowledge base #overview #perspective #statistics

From statistical knowledge bases to degrees of belief: an overview (JYH), pp. 110–113.

PODS-2006-KolahiL #dependence #normalisation #on the

On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF (SK, LL), pp. 114–123.

PODS-2006-GottlobPW #bound #database #design

Tractable database design through bounded treewidth (GG, RP, FW), pp. 124–133.

PODS-2006-MotwaniX #evolution #graph #modelling #random #web

Evolution of page popularity under random web graph models (RM, YX), pp. 134–142.

PODS-2006-MishraS #privacy #pseudo #sketching

Privacy via pseudorandom sketches (NM, MS), pp. 143–152.

PODS-2006-AggarwalFKKPTZ #clustering

Achieving anonymity via clustering (GA, TF, KK, SK, RP, DT, AZ), pp. 153–162.

PODS-2006-MachanavajjhalaG #on the #performance #privacy

On the efficiency of checking perfect privacy (AM, JG), pp. 163–172.

PODS-2006-KimelfeldS #approximate #keyword #proximity

Finding and approximating top-k answers in keyword proximity search (BK, YS), pp. 173–182.

PODS-2006-YangKC #constraints

Efficiently ordering subgoals with access constraints (GY, MK, VKC), pp. 183–192.

PODS-2006-CondonDHW #algorithm #pipes and filters #problem

Flow algorithms for two pipelined filter ordering problems (AC, AD, LH, NW), pp. 193–202.

PODS-2006-GoelGM #modelling #optimisation #using

Asking the right questions: model-driven optimization using probes (AG, SG, KM), pp. 203–212.

PODS-2006-Koch #query

Processing queries on tree-structured data efficiently (CK), pp. 213–224.

PODS-2006-PaghP #scalability

Scalable computation of acyclic joins (AP, RP), pp. 225–232.

PODS-2006-BenderFK #string

Cache-oblivious string B-trees (MAB, MFC, BCK), pp. 233–242.

PODS-2006-GroheHS #bound #random #scalability #set

Randomized computations on large data sets: tight lower bounds (MG, AH, NS), pp. 243–252.

PODS-2006-BuriolFLMS #data type

Counting triangles in data streams (LSB, GF, SL, AMS, CS), pp. 253–262.

PODS-2006-CormodeKMS #algorithm #data type

Space- and time-efficient deterministic algorithms for biased quantiles over data streams (GC, FK, SM, DS), pp. 263–272.

PODS-2006-GuhaM #approximate #order

Approximate quantiles and the order of the stream (SG, AM), pp. 273–279.

PODS-2006-GangulyM

Deterministic k-set structure (SG, AM), pp. 280–289.

PODS-2006-LeeT #performance

A simpler and more efficient deterministic scheme for finding frequent items over sliding windows (LKL, HFT), pp. 290–297.

PODS-2006-ZhaoOWX #distributed #set

Finding global icebergs over distributed data sets (QZ, MO, HW, J(X), pp. 298–307.

PODS-2006-KashyapDNRS #performance

Efficient gossip-based aggregate computation (SRK, SD, KVMN, RR, AS), pp. 308–317.

PODS-2006-GyssensPGF #documentation #navigation #semantics #xpath

Structural characterizations of the semantics of XPath as navigation tool on a document (MG, JP, DVG, GHLF), pp. 318–327.

PODS-2006-Cate #transitive #xpath

The expressivity of XPath with transitive closure (BtC), pp. 328–337.

PODS-2006-BohannonPV #lens #relational

Relational lenses: a language for updatable views (AB, BCP, JAV), pp. 338–347.

PODS-2006-GollapudiKS #clustering #programmable

Programmable clustering (SG, RK, DS), pp. 348–354.

PODS-2006-FranconiT #logic #rdf #tutorial

The logic of RDF and SPARQL: a tutorial (EF, ST), p. 355.

PODS-2006-Rosati #database #decidability #finite #on the #query

On the decidability and finite controllability of query processing in databases with incomplete information (RR), pp. 356–365.