# Paris Kanellakis

> Greek database researcher (1953–1995)

**Wikidata**: [Q7137316](https://www.wikidata.org/wiki/Q7137316)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Paris_Kanellakis)  
**Source**: https://4ort.xyz/entity/paris-kanellakis

## Summary
Paris Kanellakis was a Greek computer scientist and database researcher known for his contributions to theoretical computer science and database systems. He was a professor at Brown University and made significant advances in areas such as database theory, distributed computing, and computational complexity.

## Biography
- Born: December 3, 1953, in Athens, Greece
- Nationality: Greek
- Education: Ph.D. from Massachusetts Institute of Technology (MIT)
- Known for: Database theory, distributed computing, computational complexity
- Employer(s): Brown University (professor), MIT (student)
- Field(s): Computer science, database research, theoretical computer science

## Contributions
Paris Kanellakis made fundamental contributions to database theory, particularly in the areas of constraint databases and the complexity of query processing. His work on the complexity of constraint satisfaction problems helped establish theoretical foundations for modern database systems. At Brown University, he developed influential theories about distributed computing and fault tolerance that became essential to understanding how large-scale systems maintain consistency. His research papers from the 1980s and early 1990s continue to be cited as foundational texts in database theory and distributed systems design.

## FAQs
### Q: What was Paris Kanellakis's main area of research?
A: His primary research focused on database theory, distributed computing, and computational complexity, with particular emphasis on constraint databases and query processing complexity.

### Q: Where did Paris Kanellakis work as a professor?
A: He was a professor at Brown University from 1981 until his death in 1995.

### Q: What is the Kanellakis Theory and Practice Award?
A: This is an award named in his honor by the ACM (Association for Computing Machinery) that recognizes theoretical accomplishments that have had significant practical impact on computing.

## Why They Matter
Paris Kanellakis's theoretical work provided the mathematical foundations that enable modern database systems to process complex queries efficiently. His research on constraint databases helped establish how databases can handle sophisticated logical conditions, which is fundamental to how contemporary systems manage complex data relationships. The theories he developed about distributed computing and fault tolerance continue to influence how large-scale systems are designed to maintain consistency and reliability. His untimely death in 1995 cut short a brilliant career, but his published work remains essential reading in computer science education and continues to shape how researchers approach database and distributed systems problems.

## Notable For
- Developing foundational theories for constraint database systems
- Making significant contributions to distributed computing and fault tolerance
- Being a professor at Brown University from 1981-1995
- Having the ACM Kanellakis Theory and Practice Award named in his honor
- Publishing influential papers on computational complexity and database theory

## Body
### Early Life and Education
Paris Kanellakis was born on December 3, 1953, in Athens, Greece. He pursued his higher education in the United States, earning his Ph.D. from the Massachusetts Institute of Technology (MIT), where he studied under prominent computer scientists.

### Academic Career
Kanellakis joined Brown University as a professor in 1981, where he spent the remainder of his career until his death in 1995. At Brown, he became known for his rigorous theoretical approach to computer science problems and his ability to bridge theoretical concepts with practical applications.

### Research Contributions
His research spanned multiple areas of theoretical computer science. In database theory, he worked on constraint databases, which deal with databases that can express complex logical conditions and relationships. His work helped establish the theoretical complexity of processing different types of database queries, which directly influenced how database systems are optimized today.

In distributed computing, Kanellakis contributed to understanding how systems can maintain consistency and handle failures when components are spread across networks. His theories about fault tolerance and distributed algorithms remain relevant to modern cloud computing and distributed systems design.

### Legacy
The Association for Computing Machinery (ACM) established the Paris Kanellakis Theory and Practice Award in 1995 to honor his memory. This award recognizes specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing, reflecting Kanellakis's own approach to research that combined deep theoretical insights with practical applications.

## Schema Markup
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Paris Kanellakis",
  "jobTitle": "Computer Scientist",
  "nationality": {
    "@type": "Country",
    "name": "Greece"
  },
  "birthDate": "1953-12-03",
  "birthPlace": "Athens, Greece",
  "alumniOf": [
    {
      "@type": "EducationalOrganization",
      "name": "Massachusetts Institute of Technology"
    }
  ],
  "worksFor": {
    "@type": "Organization",
    "name": "Brown University"
  },
  "knowsAbout": [
    "Database Theory",
    "Distributed Computing",
    "Computational Complexity"
  ],
  "sameAs": [
    "https://en.wikipedia.org/wiki/Paris_Kanellakis",
    "https://www.wikidata.org/wiki/Q54919"
  ],
  "description": "Greek computer scientist known for contributions to database theory and distributed computing"
}

## References

1. Mathematics Genealogy Project
2. International Standard Name Identifier
3. Virtual International Authority File
4. Faceted Application of Subject Terminology
5. National Library of Israel Names and Subjects Authority File