D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 53 Citations 13,786 139 World Ranking 2451 National Ranking 41

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Artificial intelligence
  • Algorithm

His main research concerns Theoretical computer science, Information retrieval, Query language, Functional dependency and Relational database. He performs multidisciplinary study in Theoretical computer science and Forward chaining in his work. His Information retrieval study combines topics in areas such as Ranking and Set.

His work carried out in the field of Query language brings together such families of science as Data modeling and Object model. Expression is closely connected to Discrete mathematics in his research, which is encompassed under the umbrella topic of Relational database. While the research belongs to areas of Join dependency, he spends his time largely on the problem of Chase, intersecting his research to questions surrounding Algorithm.

His most cited work include:

  • The TSIMMIS Approach to Mediation: Data Models and Languages (806 citations)
  • Magic Sets and Other Strange Ways to Implement Logic Programs. (618 citations)
  • Answering Queries Using Views. (556 citations)

What are the main themes of his work throughout his whole career to date?

His primary areas of study are Theoretical computer science, Discrete mathematics, Information retrieval, Algorithm and Query language. His studies in Theoretical computer science integrate themes in fields like Functional dependency, Relational database, Conjunctive query, Set and Query optimization. His study in Discrete mathematics is interdisciplinary in nature, drawing from both Dependency theory and Combinatorics.

His research in Information retrieval intersects with topics in Ranking and XML. His XML research focuses on Semantics and how it relates to Probabilistic logic and Data mining. His work deals with themes such as Data modeling, Pattern matching, Web query classification, RDF query language and Semantics, which intersect with Query language.

He most often published in these fields:

  • Theoretical computer science (34.30%)
  • Discrete mathematics (21.51%)
  • Information retrieval (19.19%)

What were the highlights of his more recent work (between 2008-2017)?

  • Information retrieval (19.19%)
  • Theoretical computer science (34.30%)
  • XML (12.79%)

In recent papers he was focusing on the following fields of study:

The scientist’s investigation covers issues in Information retrieval, Theoretical computer science, XML, Keyword search and Graph. Yehoshua Sagiv combines subjects such as Ranking, Efficient XML Interchange and XML framework with his study of Information retrieval. His research integrates issues of Set, Object, Probabilistic logic, Heuristic and Optimization problem in his study of Theoretical computer science.

His XML study often links to related topics such as Algorithm. His work on Tree as part of general Algorithm study is frequently linked to Geo spatial, therefore connecting diverse disciplines of science. Yehoshua Sagiv has researched Relational database in several fields, including Tuple and Negation.

Between 2008 and 2017, his most popular works were:

  • On the expressiveness of probabilistic XML models (73 citations)
  • Query evaluation over probabilistic XML (51 citations)
  • Running tree automata on probabilistic XML (44 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Artificial intelligence
  • Algorithm

Yehoshua Sagiv mainly investigates Theoretical computer science, Algorithm, Data mining, XML and Probabilistic logic. In his study, Yehoshua Sagiv carries out multidisciplinary Theoretical computer science and Route planning software research. His study on Tree structure is often connected to Geo spatial as part of broader study in Algorithm.

His Data mining research includes themes of Object, Preprocessor and Semantics. His work in the fields of Document Structure Description overlaps with other areas such as Twig. His Probabilistic logic study integrates concerns from other disciplines, such as Subspace topology, Data dependency, Aggregate, Probabilistic database and Data integrity.

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.

Best Publications

The TSIMMIS Approach to Mediation: Data Models and Languages

Hector Garcia-Molina;Yannis Papakonstantinou;Dallan Quass;Anand Rajaraman.
next generation information technologies and systems (1997)

1221 Citations

Magic Sets and Other Strange Ways to Implement Logic Programs.

François Bancilhon;David Maier;Yehoshua Sagiv;Jeffrey D. Ullman.
symposium on principles of database systems (1986)

1106 Citations

Answering Queries Using Views.

Alon Y. Levy;Alberto O. Mendelzon;Yehoshua Sagiv;Divesh Srivastava.
symposium on principles of database systems (1995)

1027 Citations

XSEarch: a semantic search engine for XML

Sara Cohen;Jonathan Mamou;Yaron Kanza;Yehoshua Sagiv.
very large data bases (2003)

848 Citations

Magic sets and other strange ways to implement logic programs (extended abstract)

Francois Bancilhon;David Maier;Yehoshua Sagiv;Jeffrey D Ullman.
symposium on principles of database systems (1985)

695 Citations

Testing implications of data dependencies

David Maier;Alberto O. Mendelzon;Yehoshua Sagiv.
ACM Transactions on Database Systems (1979)

650 Citations

The Information Manifold

Thomas Kirk;Alon Y. Levy;Yehoshua Sagiv;Divesh Srivastava.
(1995)

578 Citations

Answering queries using views (extended abstract)

Alon Y. Levy;Alberto O. Mendelzon;Yehoshua Sagiv.
symposium on principles of database systems (1995)

538 Citations

Querying object-oriented databases

Michael Kifer;Won Kim;Yehoshua Sagiv.
international conference on management of data (1992)

508 Citations

Equivalences among Relational Expressions

Alfred V. Aho;Yehoshua Sagiv;Jeffrey D. Ullman.
SIAM Journal on Computing (1979)

476 Citations

Best Scientists Citing Yehoshua Sagiv

Diego Calvanese

Diego Calvanese

Free University of Bozen-Bolzano

Publications: 81

Georg Gottlob

Georg Gottlob

University of Oxford

Publications: 81

Maurizio Lenzerini

Maurizio Lenzerini

Sapienza University of Rome

Publications: 70

Moshe Y. Vardi

Moshe Y. Vardi

Rice University

Publications: 68

Giuseppe De Giacomo

Giuseppe De Giacomo

Sapienza University of Rome

Publications: 59

Dan Suciu

Dan Suciu

University of Washington

Publications: 56

Serge Abiteboul

Serge Abiteboul

French Institute for Research in Computer Science and Automation - INRIA

Publications: 51

Jeffrey D. Ullman

Jeffrey D. Ullman

Stanford University

Publications: 48

Raghu Ramakrishnan

Raghu Ramakrishnan

Microsoft (United States)

Publications: 46

Yannis Papakonstantinou

Yannis Papakonstantinou

University of California, San Diego

Publications: 43

Alon Y. Levy

Alon Y. Levy

Facebook (United States)

Publications: 40

Jiawei Han

Jiawei Han

University of Illinois at Urbana-Champaign

Publications: 35

Jeffrey Xu Yu

Jeffrey Xu Yu

Chinese University of Hong Kong

Publications: 34

Nicola Leone

Nicola Leone

University of Calabria

Publications: 33

Ronald Fagin

Ronald Fagin

IBM (United States)

Publications: 33

Alon Halevy

Alon Halevy

Facebook (United States)

Publications: 31

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us
Something went wrong. Please try again later.