WorldCat Identities

Kanellakis, P. C. (Paris C.) 1953-

Overview
Works: 37 works in 85 publications in 1 language and 1,206 library holdings
Genres: Conference proceedings 
Roles: Editor, Honoree
Classifications: QA76.9.D3, 005.74
Publication Timeline
Key
Publications about  P. C Kanellakis Publications about P. C Kanellakis
Publications by  P. C Kanellakis Publications by P. C Kanellakis
posthumous Publications by P. C Kanellakis, published posthumously.
Most widely held works by P. C Kanellakis
ICDT '90 : Third International Conference on Database Theory, Paris, France, December 12-14, 1990 : proceedings by S Abiteboul ( Book )
12 editions published in 1990 in English and held by 343 WorldCat member libraries worldwide
"The emergence of new paradigms for data management raises a variety of exciting challenges. An important goal of database theory is to answer these challenges by providing sound foundations for the development of the field. This volume contains the papers selected for the third International Conference on Database Theory, ICDT'90. The conferences in this series are held biannually in beautiful European cities, Rome in 1986 and Bruges in 1988 with proceedings published as volumes 234 and 326 in the same series. ICDT'90 was organized in Paris by the Institut National de Recherche en Informatique et Automatique. The conference features 2 invited presentations and 31 papers selected from 129 submissions. The papers describe original ideas and new results on the foundations of databases, knowledge bases, object-oriented databases, relational theory, transaction management, data structures and deductive databases. The volume offers a good overview of the state of the art and the current trends in database theory. It should be a valuable source of information for researchers interested in the field."--PUBLISHER'S WEBSITE
Building an object-oriented database system : the story of O₂ ( Book )
11 editions published between 1992 and 2006 in English and held by 297 WorldCat member libraries worldwide
Fault-tolerant parallel computation by P. C Kanellakis ( Book )
9 editions published between 1997 and 2011 in English and Undetermined and held by 172 WorldCat member libraries worldwide
Fault-Tolerant Parallel Computation presents recent advances in algorithmic ways of introducing fault-tolerance in multiprocessors under the constraint of preserving efficiency. The difficulty associated with combining fault-tolerance and efficiency is that the two have conflicting means: fault-tolerance is achieved by introducing redundancy, while efficiency is achieved by removing redundancy. This monograph demonstrates how in certain models of parallel computation it is possible to combine efficiency and fault-tolerance and shows how it is possible to develop efficient algorithms without concern for fault-tolerance, and then correctly and efficiently execute these algorithms on parallel machines whose processors are subject to arbitrary dynamic fail-stop errors. The efficient algorithmic approaches to multiprocessor fault-tolerance presented in this monograph make a contribution towards bridging the gap between the abstract models of parallel computation and realizable parallel architectures. Fault-Tolerant Parallel Computation presents the state of the art in algorithmic approaches to fault-tolerance in efficient parallel algorithms. The monograph synthesizes work that was presented in recent symposia and published in refereed journals by the authors and other leading researchers. This is the first text that takes the reader on the grand tour of this new field summarizing major results and identifying hard open problems. This monograph will be of interest to academic and industrial researchers and graduate students working in the areas of fault-tolerance, algorithms and parallel computation and may also be used as a text in a graduate course on parallel algorithmic techniques and fault-tolerance
PCK50 : principles of computing & knowledge : Paris C. Kanellakis Memorial Workshop, on the occasion of his 50th birthday : San Diego, California, USA, June 8th, 2003 by Paris C. Kanellakis Memorial Workshop ( Book )
5 editions published in 2003 in English and held by 145 WorldCat member libraries worldwide
Database programming languages : bulk types & persistent data : the Third International Workshop, August 27-30, 1991, Nafplion, Greece ( Book )
4 editions published between 1991 and 1992 in English and held by 92 WorldCat member libraries worldwide
The Theory of databases ( Book )
2 editions published in 1986 in English and held by 36 WorldCat member libraries worldwide
The complexity of concurrency control for distributed databases by P. C Kanellakis ( Book )
2 editions published in 1981 in English and held by 11 WorldCat member libraries worldwide
Elements of relational database theory by P. C Kanellakis ( Book )
2 editions published between 1988 and 1989 in English and held by 11 WorldCat member libraries worldwide
The theory of queries is very much related to research on database logic programs, which are an elegant formalism for the study of the principles of knowledge base systems. The optimization of such programs involves both techniques developed for the relational data model and new methods for analysing recursive definitions. The exposition closes with a discussion of how relational database theory deals with the problems of complex objects, incomplete information and database updates."
On the sequential nature of unification by Cynthia Dwork ( Book )
3 editions published between 1983 and 1984 in English and held by 9 WorldCat member libraries worldwide
The problem of unification of terms is log-space complete for P. in deriving this lower bound no use is made of the potentially concise representation of terms by directed acyclic graphs. In addition, the problem remains complete even if infinite substitutions are allowed. A consequence of this result is that parallelism cannot significantly improve on the best sequential solutions for unification. The dual problem of computing the congruence closure of an equivalence relation is also log-space complete for P. However, it is shown that for the problem of term matching, an important subcase of unification, there is a good parallel algorithm using O(log 2 n) time and nO(1) processors on a PRAM. For the O(log2 n) parallel time upper bound it is assumed that the terms are represented by directed acyclic graphs; if the longer string representation is used an O(log n) parallel time bound is obtained. (Author)
Object identity as a query language primitive by S Abiteboul ( Book )
3 editions published in 1989 in English and held by 9 WorldCat member libraries worldwide
Efficient parallel algorithms can be made robust by P. C Kanellakis ( Book )
1 edition published in 1989 in English and held by 6 WorldCat member libraries worldwide
For the common case of fail-stop errors, we develop a general and easy to implement technique to make robust many efficient parallel algorithms, e.g., algorithms for all the problems listed above. More specifically, for any dynamic pattern of fail-stop errors on a CRCW PRAM with at least one surviving processor, our method increases the original algorithm cost by at most a polylog multiplicative factor. We also show that at least a log/loglog multiplicative overhead will be incurred for certain patterns of failures by any algorithm that implements robust solutions to the problems listed."
Efficient parallelism for structured data : directed reachability in S-P dags by Foto N Afrati ( Book )
1 edition published in 1988 in English and held by 6 WorldCat member libraries worldwide
Polynomial-time implication problems for unary inclusion dependencies by Stavros S Cosmadakis ( Book )
2 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
A data structure for arc insertion and regular path finding by Adam Louis Buchsbaum ( Book )
1 edition published in 1989 in English and held by 5 WorldCat member libraries worldwide
Abstract: "Let L be the language defined by some deterministic k-state automaton with accepting states F, and let G be a directed graph with n nodes and m labeled arcs. The dynamic L-path problem is to process efficiently and on-line two kinds of operations: (1) inserting arcs into G, and (2) given two nodes u and v in G, finding a path from u to v that is labeled by some word of L, or reporting that none exists. We present a data structure that supports insertion and regular path existence queries in O(nk²) amortized time and O([absolute value]F) worst-case time, respectively
On the representation and querying of sets of possible worlds by S Abiteboul ( Book )
1 edition published in 1987 in English and held by 5 WorldCat member libraries worldwide
Logic programming and parallel complexity by P. C Kanellakis ( Book )
1 edition published in 1986 in English and held by 5 WorldCat member libraries worldwide
Unification and ML type reconstruction by P. C Kanellakis ( Book )
1 edition published in 1990 in English and held by 5 WorldCat member libraries worldwide
Parallel evaluation of recursive rule queries by Stavros S Cosmadakis ( Book )
1 edition published in 1985 in English and held by 5 WorldCat member libraries worldwide
Selected papers of the International Conference on Database Theory (ICDT) by International Conference on Database Theory ( Book )
2 editions published in 1993 in English and held by 5 WorldCat member libraries worldwide
Polymorphic unification and ML typing by P. C Kanellakis ( Book )
1 edition published in 1989 in English and held by 5 WorldCat member libraries worldwide
Our lower bound stands in contrast to the common belief that typing ML programs is 'efficient, ' and to practical experience which suggests that the algorithms commonly used for this task do not slow compilation substantially."
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.84 (from 0.47 for Special is ... to 1.00 for The shinin ...)
Alternative Names
Kanellakis, Paris C.
Kanellakis, Paris C., 1953-
Kanellakis, Paris C. 1953-1995
Kanellakis, Paris Christos
Languages
English (66)
Covers