Frank Neven, Catriel Beeri, Tova Milo
Proceedings of the 22nd Symposium on Principles of Database Systems
PODS-2003, 2003.

@proceedings{PODS-2003,
	acmid         = "773153",
	address       = "San Diego, California, USA",
	editor        = "Frank Neven and Catriel Beeri and Tova Milo",
	isbn          = "1-58113-670-6",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 22nd Symposium on Principles of Database Systems}",
	year          = 2003,
}

Contents (29 items)

8 ×#query
5 ×#xml
3 ×#complexity
3 ×#database
3 ×#documentation
3 ×#on the
3 ×#privacy
3 ×#using
2 ×#approach
2 ×#data mining

PODS-2003-HullBCS #named

E-services: a look behind the curtain (RH, MB, VC, JS), pp. 1–14.

PODS-2003-ArenasL #approach #normalisation #relational #xml

An information-theoretic approach to normal forms for relational and XML data (MA, LL), pp. 15–26.

PODS-2003-KhullerKW #algorithm #migration

Algorithms for data migration with cloning (SK, YAK, YC(W), pp. 27–36.

PODS-2003-Agrawal #privacy

Privacy in data systems (RA), p. 37.

PODS-2003-ChirkovaL #query

Materializing views with minimal size to answer queries (RC, CL), pp. 38–48.

PODS-2003-Lechtenborger #approach #constant #towards

The impact of the constant complement approach towards view updating (JL), pp. 49–55.

PODS-2003-CalvaneseGLV #query

View-based query containment (DC, GDG, ML, MYV), pp. 56–67.

PODS-2003-GuptaSH #problem #xml

The view selection problem for XML content based routing (AKG, DS, AYH), pp. 68–77.

PODS-2003-KanzaS

Computing full disjunctions (YK, YS), pp. 78–89.

PODS-2003-FaginKP

Data exchange: getting to the core (RF, PGK, LP), pp. 90–101.

PODS-2003-Behrend #database #deduction #evaluation #query #set

Soft stratification for magic set based query evaluation in deductive databases (AB), pp. 102–110.

PODS-2003-GrahneT #constraints #query #using

Query containment and rewriting using views for regular path queries under constraints (GG, AT), pp. 111–122.

PODS-2003-MendelzonP #set

Concise descriptions of subsets of structured sets (AOM, KQP), pp. 123–133.

PODS-2003-DittrichSTW #on the

On producing join results early (JPD, BS, DST, PW), pp. 134–142.

PODS-2003-GarofalakisK #correlation #data type #distance #edit distance #using #xml

Correlating XML data streams using tree-edit distance embeddings (MNG, AK), pp. 143–154.

PODS-2003-SeidlSM #documentation #query

Numerical document queries (HS, TS, AM), pp. 155–166.

PODS-2003-Segoufin #bound #complexity #documentation #query #type system #xml

Typing and querying XML documents: some complexity bounds (LS), pp. 167–178.

PODS-2003-GottlobKP #complexity #evaluation #query #xpath

The complexity of XPath query evaluation (GG, CK, RP), pp. 179–190.

PODS-2003-Gross-Amblard #database #documentation #relational #xml

Query-preserving watermarking of relational databases and XML documents (DGA), pp. 191–201.

PODS-2003-DinurN #privacy

Revealing information while preserving privacy (ID, KN), pp. 202–210.

PODS-2003-EvfimievskiGS #data mining #mining #privacy

Limiting privacy breaches in privacy preserving data mining (AVE, JG, RS), pp. 211–222.

PODS-2003-CohenS #maintenance

Maintaining time-decaying stream aggregates (EC, MS), pp. 223–233.

PODS-2003-BabcockDMO #data type #maintenance

Maintaining variance and k-medians over data stream windows (BB, MD, RM, LO), pp. 234–243.

PODS-2003-HeerenJP #using

Optimal indexing using near-minimal space (CH, HVJ, LP), pp. 244–251.

PODS-2003-AggarwalA #nearest neighbour #on the

On nearest neighbor indexing of nonlinear trajectories (CCA, DA), pp. 252–259.

PODS-2003-CaliLR #complexity #consistency #database #decidability #on the #query #semistructured data

On the decidability and complexity of query answering over inconsistent and incomplete databases (AC, DL, RR), pp. 260–271.

PODS-2003-KiferGBW #how

How to quickly find a witness (DK, JG, CB, WMW), pp. 272–283.

PODS-2003-RameshMZ #data mining #mining #theory and practice

Feasible itemset distributions in data mining: theory and application (GR, WM, MJZ), pp. 284–295.

PODS-2003-CormodeM #what

What’s hot and what’s not: tracking most frequent items dynamically (GC, SM), pp. 296–306.