Kanellakis, P. C. (Paris C.) 1953
Overview
Works:  46 works in 143 publications in 2 languages and 1,377 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Honoree 
Classifications:  QA76.9.D3, 005.74 
Publication Timeline
.
Most widely held works about
P. C Kanellakis
 Special issue commemorating the 50th birthday anniversary of Paris C. Kanellakis( Book )
 The shining star and tragic loss of ParisChristos Kanellakis and his family : internationally acclaimed professor of computer science at the Brown University, Rhode Island, in the United States of America, December 3, 1953December 20, 1995( Book )
Most widely held works by
P. C Kanellakis
ICDT '90 : Third International Conference on Database Theory, Paris, France, December 1214, 1990 : proceedings by
S Abiteboul(
Book
)
13 editions published in 1990 in English and Italian and held by 300 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, objectoriented 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
13 editions published in 1990 in English and Italian and held by 300 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, objectoriented 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 objectoriented database system : the story of O₂(
Book
)
15 editions published between 1992 and 2006 in English and held by 294 WorldCat member libraries worldwide
15 editions published between 1992 and 2006 in English and held by 294 WorldCat member libraries worldwide
Faulttolerant parallel computation by
P. C Kanellakis(
Book
)
11 editions published between 1997 and 2011 in English and Undetermined and held by 156 WorldCat member libraries worldwide
FaultTolerant Parallel Computation presents recent advances in algorithmic ways of introducing faulttolerance in multiprocessors under the constraint of preserving efficiency. The difficulty associated with combining faulttolerance and efficiency is that the two have conflicting means: faulttolerance 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 faulttolerance and shows how it is possible to develop efficient algorithms without concern for faulttolerance, and then correctly and efficiently execute these algorithms on parallel machines whose processors are subject to arbitrary dynamic failstop errors. The efficient algorithmic approaches to multiprocessor faulttolerance presented in this monograph make a contribution towards bridging the gap between the abstract models of parallel computation and realizable parallel architectures. FaultTolerant Parallel Computation presents the state of the art in algorithmic approaches to faulttolerance 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 faulttolerance, algorithms and parallel computation and may also be used as a text in a graduate course on parallel algorithmic techniques and faulttolerance
11 editions published between 1997 and 2011 in English and Undetermined and held by 156 WorldCat member libraries worldwide
FaultTolerant Parallel Computation presents recent advances in algorithmic ways of introducing faulttolerance in multiprocessors under the constraint of preserving efficiency. The difficulty associated with combining faulttolerance and efficiency is that the two have conflicting means: faulttolerance 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 faulttolerance and shows how it is possible to develop efficient algorithms without concern for faulttolerance, and then correctly and efficiently execute these algorithms on parallel machines whose processors are subject to arbitrary dynamic failstop errors. The efficient algorithmic approaches to multiprocessor faulttolerance presented in this monograph make a contribution towards bridging the gap between the abstract models of parallel computation and realizable parallel architectures. FaultTolerant Parallel Computation presents the state of the art in algorithmic approaches to faulttolerance 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 faulttolerance, algorithms and parallel computation and may also be used as a text in a graduate course on parallel algorithmic techniques and faulttolerance
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
)
7 editions published in 2003 in English and held by 132 WorldCat member libraries worldwide
7 editions published in 2003 in English and held by 132 WorldCat member libraries worldwide
Database programming languages : bulk types & persistent data : the Third International Workshop, August 2730, 1991, Nafplion,
Greece(
Book
)
5 editions published between 1991 and 1992 in English and held by 88 WorldCat member libraries worldwide
5 editions published between 1991 and 1992 in English and held by 88 WorldCat member libraries worldwide
The Theory of databases by
P. C Kanellakis(
Book
)
5 editions published between 1979 and 1986 in English and held by 39 WorldCat member libraries worldwide
5 editions published between 1979 and 1986 in English and held by 39 WorldCat member libraries worldwide
The complexity of concurrency control for distributed databases by
P. C Kanellakis(
Book
)
4 editions published in 1981 in English and held by 14 WorldCat member libraries worldwide
4 editions published in 1981 in English and held by 14 WorldCat member libraries worldwide
Elements of relational database theory by
P. C Kanellakis(
Book
)
4 editions published between 1988 and 1989 in English and held by 13 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."
4 editions published between 1988 and 1989 in English and held by 13 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."
Object identity as a query language primitive by
S Abiteboul(
Book
)
6 editions published in 1989 in English and held by 12 WorldCat member libraries worldwide
6 editions published in 1989 in English and held by 12 WorldCat member libraries worldwide
On the sequential nature of unification by
Cynthia Dwork(
Book
)
4 editions published between 1983 and 1984 in English and held by 9 WorldCat member libraries worldwide
The problem of unification of terms is logspace 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 logspace 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)
4 editions published between 1983 and 1984 in English and held by 9 WorldCat member libraries worldwide
The problem of unification of terms is logspace 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 logspace 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)
Constraint query languages by
P. C Kanellakis(
Book
)
7 editions published between 1989 and 1992 in English and held by 9 WorldCat member libraries worldwide
Abstract: "We discuss the relationship between constraint programming and database query languages. We show that bottomup efficient, declarative database programming can be combined with efficient constraint solving. The key intuition is that the generalization of a ground fact, or tuple, is a conjunction of constraints. We describe the basic Constraint Query Language design principles, and illustrate them with four different classes of constraints: Polynomial constraints, rational order, equality and boolean constraints."
7 editions published between 1989 and 1992 in English and held by 9 WorldCat member libraries worldwide
Abstract: "We discuss the relationship between constraint programming and database query languages. We show that bottomup efficient, declarative database programming can be combined with efficient constraint solving. The key intuition is that the generalization of a ground fact, or tuple, is a conjunction of constraints. We describe the basic Constraint Query Language design principles, and illustrate them with four different classes of constraints: Polynomial constraints, rational order, equality and boolean constraints."
Polynomialtime implication problems for unary inclusion dependencies by S. S Cosmadakis(
Book
)
4 editions published in 1987 in English and held by 8 WorldCat member libraries worldwide
4 editions published in 1987 in English and held by 8 WorldCat member libraries worldwide
A data structure for arc insertion and regular path finding by
Adam Louis Buchsbaum(
Book
)
3 editions published in 1989 in English and held by 7 WorldCat member libraries worldwide
Finding an Lpath between two nodes can be done on O(l + [absolute value]F) worstcase time, where l is the length of the path returned. This is an improvement over the O(m) time required to answer queries in the static version of this problem, for each fixed infinite L. We show how this data structure and the techniques used for building it are applicable to the area of knowledge base querying. In an amortized setting, we provide relative improvements of O(m/n) to the time bounds for answering many onesided recursive queries and even some twosided recursive queries, such as the same generation query on acrylic graph."
3 editions published in 1989 in English and held by 7 WorldCat member libraries worldwide
Finding an Lpath between two nodes can be done on O(l + [absolute value]F) worstcase time, where l is the length of the path returned. This is an improvement over the O(m) time required to answer queries in the static version of this problem, for each fixed infinite L. We show how this data structure and the techniques used for building it are applicable to the area of knowledge base querying. In an amortized setting, we provide relative improvements of O(m/n) to the time bounds for answering many onesided recursive queries and even some twosided recursive queries, such as the same generation query on acrylic graph."
Efficient parallel algorithms can be made robust by
P. C Kanellakis(
Book
)
2 editions published in 1989 in English and held by 7 WorldCat member libraries worldwide
For the common case of failstop 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 failstop 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."
2 editions published in 1989 in English and held by 7 WorldCat member libraries worldwide
For the common case of failstop 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 failstop 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 SP dags by
Foto N Afrati(
Book
)
2 editions published in 1988 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 1988 in English and held by 7 WorldCat member libraries worldwide
Unification and ML type reconstruction by
P. C Kanellakis(
Book
)
3 editions published in 1990 in English and held by 7 WorldCat member libraries worldwide
3 editions published in 1990 in English and held by 7 WorldCat member libraries worldwide
Polymorphic unification and ML typing by
P. C Kanellakis(
Book
)
2 editions published in 1989 in English and held by 6 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."
2 editions published in 1989 in English and held by 6 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."
Logic programming and parallel complexity by
P. C Kanellakis(
Book
)
2 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
2 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
On the representation and querying of sets of possible worlds by
S Abiteboul(
Book
)
2 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 6 WorldCat member libraries worldwide
On the computational complexity of cardinality constraints in relational databases by
P. C Kanellakis(
Book
)
5 editions published in 1980 in English and held by 6 WorldCat member libraries worldwide
5 editions published in 1980 in English and held by 6 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Abiteboul, S. (Serge) Author Editor
 Delobel, C. 1938 Editor
 Bancilhon, François Editor
 Shvartsman, Alex Allister 1955 Editor
 Brown University Department of Computer Science
 Goldin, Dina Q.
 Association for Computing Machinery Special Interest Group on Management of Data
 ACM Special Interest Group for Automata and Computability Theory
 Schmidt, Joachim W. 1941
 Institut national de recherche en informatique et en automatique Other
Useful Links
Associated Subjects
Algorithms Artificial intelligence Automatic theorem proving Computational complexity Computer algorithms Computer programming Computer programsCorrectness Computer science Computer scientists Database design Database management Databases Data structures (Computer science) Electronic data processing Electronic data processingDistributed processing Expert systems (Computer science) Faulttolerant computing Greece Information theory Kanellakis, P. C.(Paris C.), Ktheory Logic programming ML (Computer program language) Objectoriented databases Objectoriented programming (Computer science) Parallel processing (Electronic computers) Programming (Mathematics) Programming languages (Electronic computers) Relational databases Rhode IslandProvidence Set theory
Alternative Names
Kanellakis, Paris
Kanellakis, Paris 19531995
Kanellakis, Paris C.
Kanellakis, Paris C. 1953
Kanellakis, Paris C. 19531995
Kanellakis, Paris Christos
Kanellakis, Paris Christos 19531995
Paris Kanellakis Greek database researcher
Paris Kanellakis informaticus uit Griekenland (19531995)
Парис Канеллакис
パリス・カーネラキス
Languages
Covers