References

Background on Datalog, seminaive evaluation, EDB vs. IDB,
stratified semantics,
logic in general, and
models can be found in Ch. 3 of PDKSI (Volume I of Principles of
Database and KnowledgeBase Systems, Ullman, Computer Science Press,
1988).

Volume II (PDKSII) of the same book repeats some of the Datalog
material, including the use of function symbols, and also contains
material on conjunctive queries.

AHV (The book Foundations of Databases, by S. Abiteboul, R. Hull,
and V. Vianu, AddisonWesley, 1996)
has material on Datalog, conjunctive queries, and
wellfounded semantics.

Slides
on Datalog from CS145

M. Gelfond and V. Lifschitz, ``The stable model semantics for logic
programming,''
5th ICLP, pp. 10701080.
The original paper on stable semantics.

A. Van Gelder, K. A. Ross, and J. S. Schlipf,``The wellfounded
semantics for general logic programs,''
JACM, 1991, pp. 620650.
The original paper on wellfounded semantics.

A. Van Gelder, ``The alternating fixpoint of logic programs with
negation,'' PODS, 1989, pp. 110.
The paper that showed the alternating fixedpoint was equivalent to the
original definition.

Sariaya's algorithm is in his thesis, ``Subtree elimination algorithms
in deductive databases,'' Dept. of CS, Stanford, 1991.

R. Agrawal, T. Imielinski, A. Swami: ``Mining Associations between Sets of Items
in Massive Databases'', Proc. of the ACM
SIGMOD Int'l Conference on Management of Data,
Washington D.C., May 1993, 207216.
Postscript.
PDF.

R. Agrawal, R. Srikant: ``Fast Algorithms for Mining Association Rules'',
Proc. of the 20th Int'l Conference on Very Large
Databases, Santiago, Chile, Sept. 1994.
Postscript.
PDF.

E. Cohen et al.,
``Finding Interesting Associations without Support Pruning,''
ICDE 2000.
Postscript.

M. Fang, N. Shivakumar, H. GarciaMolina, R. Motwani, and J. Ullman,
``Computing
Iceberg Queries Efficiently,''
1998 VLDB.
Postscript.

H. Toivonen, ``Sampling Large Databases for Association Rules,''
VLDB 1996, pp. 134145.
Postscript.

J. S. Park, M.S. Chen, and P. S. Yu, ``An Effective HashBased Algorithm
for Mining Association Rules,''
1995 SIGMOD, pp. 175186.
PDF

S. Brin and L. Page,
The anatomy of a largescale
hypertextual Web search engine.

J. Kleinberg, ``Authoritative sources in a hyperlinked environment,''
J. ACM Sept., 1999, pp. 604632.
PDF.
 Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning,
and Gene H. Golub. "Exploiting the
Block Structure of the Web for Computing PageRank,"
Stanford University Technical Report, March
2003. (Submitted for publication)
[ pdf 
ps
]
 Sepandar D. Kamvar, Taher H. Haveliwala, Christopher D. Manning,
and Gene H. Golub. "Extrapolation
Methods for Accelerating PageRank Computations," In
Proceedings of the Twelfth International World Wide Web
Conference, May 2003.
[ pdf 
ps
]

Conjunctive queries with negation are from a paper by Levy and Sagiv:
Queries
independent of updates.
 Klug's method for CQ's with arithmetic is from ``On conjunctive queries
containing inequalities,'' JACM 1:35 (1988), pp. 146160.
 The Gupta/Zhang/Oszoyoglu test is found in A. Gupta's Stanford thesis ``Partial
information based integrity checking,'' 1994, and X. Zhang and M. Z. Ozsoyoglu,
``On efficient reasoning with implication constraints,'' Third DOOD Conf. (Dec., 1993),
pp. 236252.

The "LMSS" theorem is from the paper by
Levy, Mendelzon, Sagiv, and Srivastava: Answering
queries using views.

A paper on
Maximally
Contained Datalog Programs by Duschka and Genesereth.

Prasenjit Mitra's CS345 project on
The
Bucket Algorithm.

By coincidence, unification is explained in Section 12.4 of both PDKSII and AHV.

Levy, Rajaraman, and Ordille on
The
InformationManifold QueryProcessing Algorithm.

P. Bradley, U. Fayyad, and C. Reina,
``Scaling Clustering Algorithms to Large Databases,''
1998 KDD.
Postscript.

S. Guha, R. Rastogi, and K. Shim,
``CURE: An Efficient Clustering Algorithm for Large Databases,''
SIGMOD 1998.
PDF.
Note: this PDF file requires a huge amount of temp space (over 200Mb).

Venkatesh Ganti, Raghu Ramakrishnan, Johannes Gehrke, Allison L. Powell, and
James C. French:,
``Clustering Large Datasets in Arbitrary Metric Spaces,''
ICDE, pp. 502511, 1999.
PDF.