Yehoshua Sagiv
#58,233
Most Influential Person Now
Israeli computer scientist and professor
Yehoshua Sagiv's AcademicInfluence.com Rankings
Yehoshua Sagivcomputer-science Degrees
Computer Science
#2380
World Rank
#2485
Historical Rank
Database
#629
World Rank
#659
Historical Rank
Download Badge
Computer Science
Yehoshua Sagiv's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
Similar Degrees You Can Earn
Why Is Yehoshua Sagiv Influential?
(Suggest an Edit or Addition)According to Wikipedia, Yehoshua Chaim Sagiv is a computer scientist and professor of computer science at the Hebrew University of Jerusalem. He obtained his PhD at Princeton University in 1978. His advisor was Jeffrey Ullman.
Yehoshua Sagiv's Published Works
Published Works
- The TSIMMIS Approach to Mediation: Data Models and Languages (1997) (750)
- Magic sets and other strange ways to implement logic programs (extended abstract) (1985) (699)
- XSEarch: A Semantic Search Engine for XML (2003) (656)
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions (1981) (399)
- The Information Manifold (1995) (380)
- Equivalences Among Relational Expressions with the Union and Difference Operators (1980) (375)
- Querying object-oriented databases (1992) (361)
- Equivalences Among Relational Expressions (1979) (348)
- Answering queries using views (extended abstract) (1995) (344)
- Testing implications of data dependencies (1979) (335)
- Answering Queries Using Views. (1999) (331)
- Answering Queries using Templates with Binding Patterns (1995) (316)
- Testing implications of data dependencies (1979) (284)
- Queries Independent of Updates (1993) (235)
- Optimizing datalog programs (1987) (229)
- Querying Semistructured Heterogeneous Information (1995) (223)
- Concurrent operations on B-trees with overtaking (1985) (217)
- Keyword proximity search in complex data graphs (2008) (195)
- Computational Logic — CL 2000 (2000) (188)
- Finding and approximating top-k answers in keyword proximity search (2006) (188)
- Constraint checking with partial information (1994) (168)
- An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic (1981) (161)
- Undecidable optimization problems for database logic programs (1993) (145)
- Answering queries using templates with binding patterns (extended abstract) (1995) (139)
- Efficient optimization of a class of relational expressions (1979) (137)
- Efficient optimization of a class of relational expressions (1978) (134)
- Monotonic aggregation in deductive databases (1992) (128)
- Query Optimization by Predicate Move-Around (1994) (120)
- Automatic Termination Analysis of Logic Programs (1997) (116)
- A characterization of globally consistent databases and their correct access paths (1983) (112)
- Deciding equivalences among conjunctive aggregate queries (2007) (110)
- Flexible queries over semistructured data (2001) (108)
- Equivalence of relational database schemes (1979) (107)
- Object Fusion in Geographic Information Systems (2004) (103)
- Efficient evaluation of right-, left-, and multi-linear rules (1989) (99)
- On the expressiveness of probabilistic XML models (2009) (98)
- Query efficiency in probabilistic XML models (2008) (95)
- Matching Twigs in Probabilistic XML (2007) (91)
- Can we use the universal instance assumption without using nulls? (1981) (91)
- Equivalence among Relational Expressions with the Union and Difference Operation (1978) (91)
- Interconnection semantics for keyword search in XML (2005) (83)
- A General Framework for Automatic Termination Analysis of Logic Programs (2000) (82)
- Constraints and redundancy in datalog (1992) (79)
- A decidable class of bounded recursions (1987) (79)
- Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies (1982) (78)
- Semantic Query Optimization in Datalog Programs. (1994) (73)
- On the Complexity of Testing Implications of Functional and Join Dependencies (1981) (72)
- Deciding equivalences among aggregate queries (1998) (70)
- Query evaluation over probabilistic XML (2009) (70)
- Proof-tree transformation theorems and their applications (1989) (66)
- Equivalence, query-reachability and satisfiability in Datalog extensions (1993) (62)
- Inference of monotonicity constraints in Datalog programs (1989) (59)
- Containment of aggregate queries (2003) (58)
- Finding corresponding objects when integrating several geo-spatial datasets (2005) (57)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (2008) (57)
- Argument Reduction by Factoring (1989) (56)
- Rewriting queries with arbitrary aggregation functions using views (2006) (55)
- Location‐based algorithms for finding sets of corresponding objects over several geo‐spatial data sets (2010) (54)
- Static analysis in datalog extensions (2001) (53)
- Running tree automata on probabilistic XML (2009) (53)
- An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic (1980) (52)
- Interactive route search in the presence of order constraints (2010) (49)
- EquiX Easy Querying in XML Databases (1999) (48)
- TermiLog: A System for Checking Termination of Queries to Logic Programs (1997) (46)
- A Termination Test for Logic Programs (1991) (44)
- Incorporating constraints in probabilistic XML (2009) (44)
- Efficient integration of road maps (2006) (43)
- Ad hoc matching of vectorial road networks (2013) (43)
- On computing restricted projections of representative instances (1985) (43)
- Inference of Inequality Constraints in Logic Programs. (1991) (43)
- Queries with incomplete answers over semistructured data (1999) (42)
- Safety of datalog queries over infinite databases (1989) (42)
- Revisiting redundancy and minimization in an XPath fragment (2008) (41)
- Semantic query optimization in Datalog programs (extended abstract) (1995) (40)
- Speeding up Inferences Using Relevance Reasoning: A Formalism and Algorithms (1997) (38)
- Monotonic Aggregation in Deductive Database (1997) (36)
- Full disjunctions: polynomial-delay iterators in action (2006) (35)
- Efficiently enumerating results of keyword search over data graphs (2008) (35)
- Querying Incomplete Information in Semistructured Data (2002) (34)
- Is There Anything Better than Magic? (1990) (33)
- Maximally joining probabilistic data (2007) (32)
- Equivalences among aggregate queries with negation (2002) (32)
- WebSuite: A Tool Suite for Harnessing Web Data (1998) (31)
- On Termination of Datalog Programs (1989) (30)
- On rewriting XPath queries using views (2009) (29)
- EquiX - A search and query language for XML (2000) (28)
- A universal relation database system implemented via the network model (1982) (28)
- Efficient Engines for Keyword Proximity Search (2005) (28)
- Heuristic algorithms for route-search queries over geographical data (2008) (27)
- An incremental algorithm for computing ranked full disjunctions (2005) (27)
- Inference of inequality constraints in logic programs (extended abstracts) (1991) (25)
- Unfolding the Mystery of Mergesort (1997) (25)
- Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions (1983) (24)
- Route Search over Probabilistic Geospatial Data (2009) (24)
- Efficiently Enumerating Results of Keyword Search (2005) (23)
- Exploiting Irrelevance Reasoning to Guide Problem Solving (1993) (22)
- Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries (2006) (22)
- Logical Query Optimization by Proff-Tree Transformation (1993) (22)
- On Bounded Database Schemes and Bounded Horn-Clause Programs (1988) (22)
- Modeling and querying probabilistic XML data (2009) (22)
- Correction to “An equivalence between relational database dependencies and a fragment of propositional logic” (1987) (21)
- Optimizing and parallelizing ranked enumeration (2011) (21)
- Utilizing the Multiple Facets of WWW Contents (1998) (21)
- Computing a k -Route over Uncertain Geographical Data (2007) (20)
- Generating Relations from XML Documents (2003) (20)
- Solving queries by tree projections (1993) (19)
- Decomposition of Relationships through Pivoting (1996) (19)
- IQ: The Case for Iterative Querying for Knowledge (2011) (18)
- Evaluation of queries in independent database schemes (1991) (18)
- Complexity of a top-down capture rule (1984) (17)
- Using Language Models and the HITS Algorithm for XML Retrieval (2006) (17)
- An interactive approach to route search (2009) (17)
- Location-Based Distance Measures for Geosocial Similarity (2017) (17)
- New algorithms for computing Steiner trees for a fixed number of terminals (2006) (15)
- Exploratory keyword search on data graphs (2010) (15)
- Querying Semantically Tagged Documents on the World-Wide Web (1999) (15)
- Incorporating constraints in probabilistic XML (2008) (15)
- Language models for keyword search over data graphs (2012) (14)
- Twig Patterns: From XML Trees to Graphs (2006) (14)
- Integrating Data from Maps on the World-Wide Web (2006) (13)
- Optimization of queries in relational databases (1981) (13)
- Convergence of sideways query evaluation (1985) (13)
- Proving Termination for Logic Programs by the Query-Mapping Pairs Approach (2004) (13)
- Virtual Documents and Answer Priors in Keyword Search over Data Graphs (2016) (13)
- Combining Incompleteness and Ranking in Tree Queries (2007) (13)
- On the Convergence of Query Evaluation (1989) (13)
- Computing full disjunctions (2003) (12)
- Automatic Termination Analysis of Logic Programs (with Detailed Experimental Results) (1997) (12)
- Combining the Power of Searching and Querying (2000) (12)
- Representing and integrating multiple calendars (1997) (11)
- A Simple Characterization of Uniform Boundedness for a Class of Recursions (1991) (11)
- On Testing Effective Computability of Magic Programs (1991) (10)
- An Abstract Framework for Generating Maximal Answers to Queries (2005) (10)
- Minimizing Restricted-Fanout Queries (1992) (9)
- Integration of Heterogeneous Information Sources (2007) (9)
- Minimizing Expansions of Recursions (1989) (9)
- Testing Implications of Data Dependencies (Abstract). (1979) (9)
- SQL4X: A Flexible Query Language for XML and Relational Databases (2001) (9)
- Efficient and Complete Tests for Database Integrity Constraint Checking (1994) (8)
- WISER: a web-based interactive route search system for smartphones (2012) (8)
- Checking Termination of Queries to Logic Programs (1996) (7)
- A formal yet practical approach to electronic commerce (1999) (7)
- Designing globally consistent network schemas (1983) (6)
- A personalized GeoSocial app for surviving an earthquake (2015) (6)
- Optimizatioin of a Subclass of Conjunctive Queries (1990) (5)
- A Practically Efficient Algorithm for Generating Answers to Keyword Search Over Data Graphs (2015) (5)
- Concurrency and Trie Hashing (1989) (5)
- Optimization of a subclass of conjunctive queries (1995) (5)
- ExQueX: exploring and querying XML documents (2009) (5)
- Searching in an XML corpus using content and structure (2014) (5)
- A scalable and effective full-text search in P2P networks (2009) (5)
- Editor's Forword (1995) (4)
- Extracting minimum-weight tree patterns from a schema with neighborhood constraints (2013) (4)
- Generating All Maximal Induced Subgraphs for Hereditary Connected-Hereditary and Rooted-Hereditary Properties (2004) (4)
- Proceedings of the First International Conference on Computational Logic (2000) (4)
- Equivalences among aggregate queries with negation (2001) (4)
- A personal perspective on keyword search over data graphs (2013) (4)
- The Equivalence of Solving Queries and Production Tree Projections. (1986) (4)
- A Proof-Theoretic Approach to Irrelevance: Foundations and Applications (1994) (4)
- An equivalence between relational database dependencies and a subclass of proportional logic, RJ 2500(32750) (1980) (4)
- KMV-peer: a robust and adaptive peer-selection algorithm (2011) (3)
- Finding a minimal tree pattern under neighborhood constraints (2011) (3)
- Interconnection Semantics for XML (2005) (3)
- On Termination of Datalog Programs*: Extended Abstract (1990) (3)
- Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules (1989) (3)
- The equivalence of solving queries and producing tree projections (extended abstract) (1985) (3)
- Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1995) (2)
- Automatic Termination Analysis of Programs Containing Arithmetic Predicates (2000) (2)
- Incomplete Answers for Queries over Semistructured Data (1999) (2)
- Validating Constraints with Partial Information: Research Overview (1994) (2)
- Select-Project Queries over XML Documents (2002) (2)
- Toward Automated Electronic Commerce (1999) (2)
- Knowledge Management for Keyword Search over Data Graphs (2014) (1)
- A peer-selection algorithm for information retrieval (2010) (1)
- On Finite FD-Acyclicity. (1986) (1)
- A Characterization of Finite fd-Acyclicity (1989) (0)
- Classification Rules for Semi-Structured Data (1997) (0)
- Figure 4: Searching for Data Sources Using W3ql (1998) (0)
- Report on ACM-SIGMOD International Conference on Management of Data (1978) (0)
- Semantics and Algorithms for Queries with Incomplete Answers over Semistructured Data (1999) (0)
- Dwq : Esprit Long Term Research Project, No 22469 Classification Rules for Semi-structured Data Classiication Rules for Semistructured Data (1998) (0)
- Dwq : Esprit Long Term Research Project, No 22469 Classification Rules for Semi-structured Data Classiication Rules for Semistructured Data (1998) (0)
- Combining the Power of Searching and Querying, Proc. 5th International Conference on Cooperative Information Systems (2000) (0)
- 1 Distance Measures for Detecting Geo-Social Similarity (2017) (0)
- Proceedings of the Eighth Acm Sigact-sigmod-sigart Symposium on Principles of Database Systems Special Interest Group for Automata and Computability Theory (sigact) Special Interest Group for the Management of Data (sigmod) Special Interest Group for Artificial Intelligence (sigart) Tutorial: Non-mo (2013) (0)
- Sagiv,Y-On finite FD-acyclicity (1985) (0)
- Tools for Deductive Databases (Abstract) (1993) (0)
- 4.4 Emst Application on One Qgm Box Output: Query Graph G 0 after Applying Emst Rule to Box Example 4.9 Continuing with Example 4.7: a Copy Example 4.11 Continuing with Example 4.9: Sin- Example 4.13 Continuing with Example 4.11 (1994) (0)
- Textual and Visual for Content-based Image Re- 5.2 Data Preparation 5.3 Query Processing 5.3.2 Subquery Processing 4.1 Webssql Syntax Query := Select Targetattr from Tablelist Where Conditions] With-size Size] (2000) (0)
- Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee, USA (1990) (0)
- 7 Acknowledgements Example 6.1 (context Mixed-linear for Pseudo Left-linear Rules) (2007) (0)
- Tools for deductive databases (1993) (0)
- Constructing Data Graphs for Keyword Search (2016) (0)
This paper list is powered by the following services:
Other Resources About Yehoshua Sagiv
What Schools Are Affiliated With Yehoshua Sagiv?
Yehoshua Sagiv is affiliated with the following schools: