MIME-Version: 1.0 Server: CERN/3.0 Date: Tuesday, 07-Jan-97 14:43:32 GMT Content-Type: text/html Content-Length: 7283 Last-Modified: Thursday, 12-Dec-96 21:33:48 GMT
Presents a top-down algorithm for solving tree-structured
constraint satisfaction problems in linear time and evaluates its
average-case performance empirically.
(Not available on-line)
Describes a probabalistic method for predicting costs of first-answer query
plans under a modified pipelined-join execution model.
cikm96.ps.Z
(Compressed PostScript, 92k)
CSP look-back techniques (CBJ, learning), not widely used in
existing SAT algorithms, turn out to be indispensable for solving
instances which are "exceptionally hard". A new procedure
we define generates such instances consistently.
cp96.ps.Z
(Compressed PostScript, 90k)
Procedures used in this paper are
available in the toolkit linked below. Click
here for a brief description of its contents.
ehi_tool.tar.Z (v1.01)
(Tar'ed and compressed SPARC executables, 298k)
Analyzes the effects of space-bounded learning
(a.k.a. constraint-recording) schemes on the runtime complexity of
backtrack search.
aaai96.ps.Z
(Compressed PostScript, 97k)
From the perspective of achieving tractable constraint satisfaction
by restricting constraint graph structure, extensive use of space may
be of limited benefit.
ijcai95.ps.Z
(Compressed PostScript, 47k)
Describes a purely declarative method for introducing modularity into
forward-chaining rule-based languages, and its embodiment in the
syntax of the Venus rule language.
ictai94.ps.Z
(Compressed PostScript, 372k)
Overview of various results on applying constraint processing
techniques to query processing.
cp96db_lncs.ps.Z
(Compressed PostScript, 62k)
Describes agent-based architecture for integrating heterogeneous
information bases in an ever-changing network of information
sources.
(PostScript available through the
InfoSleuth Project
.)
Presents and evaluates several schemes for handling duplicate
tuple elimination during optimization and execution of large
select-project-join queries.
TR-96-11.ps.Z
(Compressed PostScript, 67k)
Proposes a method for annotating query plans with additional operators
in order to efficiently produce the query result in the form of a
directionally reduced acyclic database.
TR-95-09.ps.Z
(Compressed PostScript, 72k)