What is he best known for?
The fields of study he is best known for:
- Programming language
- Algebra
- Algorithm
His scientific interests lie mostly in Theoretical computer science, Query language, Information retrieval, XML and XML validation.
The concepts of his Theoretical computer science study are interwoven with issues in Set, Graph database, Tuple and Relational database.
His Query language study integrates concerns from other disciplines, such as Programming language, SQL, Relational calculus, Transitive closure and Query optimization.
His Information retrieval research integrates issues from Extreme point, Data exchange, Metadata management and Closed-world assumption.
His work investigates the relationship between XML and topics such as Data integrity that intersect with problems in Existential quantification and Algorithm.
The various areas that he examines in his XML validation study include Document Structure Description and XML Schema Editor.
His most cited work include:
- Elements of Finite Model Theory (684 citations)
- A normal form for XML documents (274 citations)
- Incremental maintenance of views with duplicates (257 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Theoretical computer science, Query language, Discrete mathematics, Information retrieval and Programming language.
Leonid Libkin has included themes like Graph database, XML and Relational database, Conjunctive query, Relational algebra in his Theoretical computer science study.
His XML research incorporates themes from Data integrity and Unary operation.
His work deals with themes such as Query by Example, Transitive closure, RDF query language and Query optimization, which intersect with Query language.
His work carried out in the field of Discrete mathematics brings together such families of science as Structure, Bounded function and Combinatorics.
His Information retrieval research includes elements of Data exchange, Complete information, Document Structure Description and XML Schema Editor.
He most often published in these fields:
- Theoretical computer science (38.89%)
- Query language (24.51%)
- Discrete mathematics (16.67%)
What were the highlights of his more recent work (between 2014-2021)?
- Theoretical computer science (38.89%)
- SQL (9.48%)
- Information retrieval (15.03%)
In recent papers he was focusing on the following fields of study:
Theoretical computer science, SQL, Information retrieval, Programming language and Semantics are his primary areas of study.
His study on Regular language is often connected to Perspective as part of broader study in Theoretical computer science.
His SQL study combines topics in areas such as Correctness and Null.
His work on Relational database as part of general Information retrieval study is frequently linked to Certainty, Counterintuitive and k-means clustering, bridging the gap between disciplines.
His Programming language study frequently draws connections between related disciplines such as Query language.
Leonid Libkin interconnects Data modeling, Tuple and Truth value in the investigation of issues within Semantics.
Between 2014 and 2021, his most popular works were:
- Cypher: An Evolving Query Language for Property Graphs (112 citations)
- Querying Graphs with Data (57 citations)
- SQL’s Three-Valued Logic and Certain Answers (45 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algebra
- Algorithm
The scientist’s investigation covers issues in Data science, Query language, Big data, Theoretical computer science and SQL.
In his work, Regular expression, Named graph, Formal specification and Decidability is strongly intertwined with Graph database, which is a subfield of Query language.
His research integrates issues of Domain, XML, Relational database, Data set and XPath in his study of Big data.
His research on Theoretical computer science focuses in particular on Automaton.
His SQL study incorporates themes from Correctness, Query by Example, Null and Relational algebra.
Leonid Libkin combines subjects such as Programming language, Tuple, Relational calculus, Semantics and Conjunctive query with his study of Relational algebra.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
