BibSLEIGH — Yehoshua

Travelled to:

1 × Austria
1 × Chile
1 × Greece
1 × Ireland
1 × Israel
1 × Korea
1 × The Netherlands
2 × Belgium
27 × USA
3 × China
3 × Germany
4 × Canada

Collaborated with:

B.Kimelfeld ∅ Y.Kanza J.D.Ullman A.Y.Levy S.Cohen N.Lindenstrauss O.Shmueli Y.Mass A.Serebrenik W.Nutt A.Brodsky M.Y.Vardi J.F.Naughton S.M.Kuck K.Golenberg A.O.Mendelzon R.Ramakrishnan M.Shmueli-Scheuer I.S.Mumick D.Maier E.Safra C.Beeri K.A.Ross M.Yannakakis G.Weber Y.Kosharovsky S.Shurin A.Rajaraman M.Kifer W.Kim A.V.Aho H.Achiezra R.Levin J.Mamou D.Srivastava A.Gupta J.Widom H.Gaifman H.G.Mairson F.Bancilhon I.Fadida F.N.Afrati C.H.Papadimitriou G.Papageorgiou A.Roussou

Talks about:

queri (18) program (10) search (8) constraint (7) logic (7) data (7) xml (7) equival (6) datalog (6) databas (6)

Person: Yehoshua Sagiv

DBLP: Sagiv:Yehoshua

Facilitated 2 volumes:

Contributed to:

2014

2011

2010

2009

2008

2007

2006

2005

2004

2003

2001

1999

1998

1997

1995

1994

1993

1992

1991

1990

1989

1987

1986

1985

1983

1982

1981

1979

1978

Wrote 63 papers:

CIKM-2014-MassS #graph #information management #keyword: Knowledge Management for Keyword Search over Data Graphs (YM, YS), pp. 2051–2053.
PODS-2011-KimelfeldS #constraints: Finding a minimal tree pattern under neighborhood constraints (BK, YS), pp. 235–246.
VLDB-2011-GolenbergKS #optimisation: Optimizing and Parallelizing Ranked Enumeration (KG, BK, YS), pp. 1028–1039.
CIKM-2010-MassSS #algorithm #information retrieval: A peer-selection algorithm for information retrieval (YM, YS, MSS), pp. 1601–1604.
SIGMOD-2010-AchiezraGKS #graph #keyword: Exploratory keyword search on data graphs (HA, KG, BK, YS), pp. 1163–1166.
VLDB-2010-LevinKSS #constraints #interactive #order: Interactive Route Search in the Presence of Order Constraints (RL, YK, ES, YS), pp. 117–128.
CIKM-2009-MassSS #effectiveness #network #scalability: A scalable and effective full-text search in P2P networks (YM, YS, MSS), pp. 1979–1982.
PODS-2009-CohenKS #automaton #probability #xml: Running tree automata on probabilistic XML (SC, BK, YS), pp. 227–236.
SIGMOD-2009-KimelfeldSW #documentation #named #query #xml: ExQueX: exploring and querying XML documents (BK, YS, GW), pp. 1103–1106.
PODS-2008-CohenKS #constraints #probability #xml: Incorporating constraints in probabilistic XML (SC, BK, YS), pp. 109–118.
SIGMOD-2008-GolenbergKS #graph #keyword #proximity: Keyword proximity search in complex data graphs (KG, BK, YS), pp. 927–940.
SIGMOD-2008-KimelfeldKS #modelling #performance #probability #query #xml: Query efficiency in probabilistic XML models (BK, YK, YS), pp. 701–714.
PODS-2007-KimelfeldS #probability: Maximally joining probabilistic data (BK, YS), pp. 303–312.
VLDB-2007-KimelfeldS #probability #xml: Matching Twigs in Probabilistic XML (BK, YS), pp. 27–38.
PODS-2006-KimelfeldS #approximate #keyword #proximity: Finding and approximating top-k answers in keyword proximity search (BK, YS), pp. 173–182.
VLDB-2006-CohenFKKS: Full Disjunctions: Polynomial-Delay Iterators in Action (SC, IF, YK, BK, YS), pp. 739–750.
CIKM-2005-CohenKKS #keyword #semantics #xml: Interconnection semantics for keyword search in XML (SC, YK, BK, YS), pp. 389–396.
PODS-2005-CohenS #algorithm #incremental: An incremental algorithm for computing ranked full disjunctions (SC, YS), pp. 98–107.
PDCL-2004-LindenstraussSS #approach #logic programming #proving #source code #termination: Proving Termination for Logic Programs by the Query-Mapping Pairs Approach (NL, YS, AS), pp. 453–498.
VLDB-2004-BeeriKSS #information management: Object Fusion in Geographic Information Systems (CB, YK, ES, YS), pp. 816–827.
PODS-2003-KanzaS: Computing full disjunctions (YK, YS), pp. 78–89.
VLDB-2003-CohenMKS #named #semantics #xml: XSEarch: A Semantic Search Engine for XML (SC, JM, YK, YS), pp. 45–56.
PODS-2001-CohenNS #query: Equivalences among Aggregate Queries with Negation (SC, WN, YS).
PODS-2001-KanzaS #flexibility #query #semistructured data: Flexible Queries Over Semistructured Data (YK, YS).
PODS-1999-KanzaNS #query #semistructured data: Queries with Incomplete Answers over Semistructured Data (YK, WN, YS), pp. 227–236.
PODS-1998-NuttSS #query: Deciding Equivalences Among Aggregate Queries (WN, YS, SS), pp. 214–223.
CAV-1997-LindenstraussSS #logic programming #named #query #source code #termination: TermiLog: A System for Checking Termination of Queries to Logic Programs (NL, YS, AS), pp. 444–447.
ICLP-1997-LindenstraussS #analysis #automation #logic programming #source code #termination: Automatic Termination Analysis of Logic Programs (NL, YS), pp. 63–77.
LOPSTR-1997-LindenstraussSS: Unfolding the Mystery of Mergesort (NL, YS, AS), pp. 206–225.
PODS-1995-LevyMSS #query #using: Answering Queries Using Views (AYL, AOM, YS, DS), pp. 95–104.
PODS-1995-LevyS #datalog #optimisation #query #semantics #source code: Semantic Query Optimization in Datalog Programs (AYL, YS), pp. 163–173.
PODS-1995-RajaramanSU #query #using: Answering Queries Using Templates with Binding Patterns (AR, YS, JDU), pp. 105–112.
PODS-1994-GuptaSUW #constraints: Constraint Checking with Partial Information (AG, YS, JDU, JW), pp. 45–55.
VLDB-1994-LevyMS #optimisation #query: Query Optimization by Predicate Move-Around (AYL, ISM, YS), pp. 96–107.
PODS-1993-LevyMSS #datalog #equivalence #satisfiability: Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions (AYL, ISM, YS, OS), pp. 109–122.
VLDB-1993-LevyS #independence #query: Queries Independent of Updates (AYL, YS), pp. 171–181.
PODS-1992-LevyS #constraints #datalog: Constraints and Redundancy in Datalog (AYL, YS), pp. 67–80.
PODS-1992-RossS #database #deduction: Monotonic Aggregation in Deductive Databases (KAR, YS), pp. 114–126.
SIGMOD-1992-KiferKS #database #object-oriented #query: Querying Object-Oriented Databases (MK, WK, YS), pp. 393–402.
ISLP-1991-Sagiv #logic programming #source code #termination: A Termination Test for Logic Programs (YS), pp. 518–532.
PODS-1991-BrodskyS #constraints #difference #logic programming #source code: Inference of Inequality Constraints in Logic Programs (AB, YS), pp. 227–240.
NACLP-1990-Sagiv #question: Is There Anything Better than Magic? (YS), pp. 235–254.
PODS-1989-BrodskyS #constraints #datalog #source code: Inference of Monotonicity Constraints in Datalog Programs (AB, YS), pp. 190–199.
PODS-1989-RamakrishnanSUV #program transformation #theorem: Proof-Tree Transformation Theorems and Their Applications (RR, YS, JDU, MYV), pp. 172–181.
PODS-1989-SagivV #database #datalog #infinity #query #safety: Safety of Datalog Queries over Infinite Databases (YS, MYV), pp. 160–171.
SIGMOD-1989-NaughtonRSU #evaluation #performance: Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules (JFN, RR, YS, JDU), pp. 235–242.
VLDB-1989-NaughtonRSU #reduction: Argument Reduction by Factoring (JFN, RR, YS, JDU), pp. 173–182.
LICS-1987-GaifmanMSV #database #decidability #logic programming #optimisation #problem #source code: Undecidable Optimization Problems for Database Logic Programs (HG, HGM, YS, MYV), pp. 106–115.
PODS-1987-NaughtonS #bound #decidability #recursion: A Decidable Class of Bounded Recursions (JFN, YS), pp. 227–236.
PODS-1987-Sagiv #datalog #optimisation #source code: Optimizing Datalog Programs (YS), pp. 349–362.
PODS-1986-AfratiPPRSU #convergence #evaluation #query: Convergence of Sideways Query Evaluation (FNA, CHP, GP, AR, YS, JDU), pp. 24–30.
PODS-1986-BancilhonMSU #logic programming #set #source code: Magic Sets and Other Strange Ways to Implement Logic Programs (FB, DM, YS, JDU), pp. 1–15.
PODS-1986-SagivS #equivalence #query: The Equivalence of Solving Queries and Production Tree Projections (YS, OS), pp. 160–172.
PODS-1986-SagivS86a #finite #on the: On Finite FD-Acyclicity (YS, OS), pp. 173–182.
PODS-1985-Sagiv #concurrent: Concurrent Operations on B-Trees with Overtaking (YS), pp. 28–37.
PODS-1985-Sagiv85a #on the #strict: On Computing Restricted Projections of Representative Instances (YS), pp. 171–180.
SIGMOD-1983-KuckS #consistency #design #network: Designing Globally Consistent Network Schemas (SMK, YS), pp. 185–195.
PODS-1982-KuckS #database #network: A Universal Relation Database System Implemented via the Network Model (SMK, YS), pp. 147–157.
SIGMOD-1981-Sagiv #question #using: Can We Use the Universal Instance Assumption Without Using Nulls? (YS), pp. 108–120.
SIGMOD-1979-MaierMS #dependence #testing: Testing Implications of Data Dependencies (DM, AOM, YS), p. 152.
STOC-1979-BeeriMSU #database #equivalence #relational: Equivalence of Relational Database Schemes (CB, AOM, YS, JDU), pp. 319–329.
SIGMOD-1978-AhoSU #optimisation #performance #relational: Efficient Optimization of a Class of Relational Expressions (AVA, YS, JDU), p. 39.
VLDB-1978-SagivY #difference #equivalence #relational: Equivalence among Relational Expressions with the Union and Difference Operation (YS, MY), pp. 535–548.