| 
| |  | |  |
Queries with Incomplete Answers over Semistructured Data
Note: Links lead to the DBLP on the Web.
Yehoshua Sagiv
88
David Konopnicki
,
Lior Leiba
,
Oded Shmueli
, Yehoshua Sagiv: A Formal Yet Practical Approach to Electronic Commerce.
CoopIS 1999
: 197-208
87
Yaron Kanza
,
Werner Nutt
, Yehoshua Sagiv: Incomplete Answers for Queries over Semistructured Data.
KRDB 1999
: 21-25
86
Ziv Bar-Yossef
,
Yaron Kanza
,
Yakov A. Kogan
,
Werner Nutt
, Yehoshua Sagiv: Querying Semantically Tagged Documents on the World-Wide Web.
NGITS 1999
: 2-19
85
Yaron Kanza
,
Werner Nutt
, Yehoshua Sagiv: Queries with Incomplete Answers over Semistructured Data.
PODS 1999
: 227-236
84
Sara Cohen
,
Yaron Kanza
,
Yakov A. Kogan
,
Werner Nutt
, Yehoshua Sagiv,
A. Serebrenik
: EquiX Easy Querying in XML Databases.
WebDB (Informal Proceedings) 1999
: 43-48
83
Nachum Dershowitz
,
Naomi Lindenstrauss
, Yehoshua Sagiv,
A. Serebrenik
: Automatic Termination Analysis of Programs Containing Arithmetic Predicates.
Electronic Notes in Theoretical Computer Science 30
(1): (1999)
82
Werner Nutt
, Yehoshua Sagiv,
Sara Shurin
: Deciding Equivalences Among Aggregate Queries.
PODS 1998
: 214-223
81
Catriel Beeri
,
Gershon Elber
,
Tova Milo
, Yehoshua Sagiv,
Oded Shmueli
,
Naftali Tishby
,
Yakov A. Kogan
,
David Konopnicki
,
Pini Mogilevski
,
Noam Slonim
: WebSuite: A Tool Suite for Harnessing Web Data.
WebDB 1998
: 152-171
80
Yakov A. Kogan
,
David Michaeli
, Yehoshua Sagiv,
Oded Shmueli
: Utilizing the Multiple Facets of WWW Contents.
DKE 28
(3): 255-275 (1998)
79
Naomi Lindenstrauss
, Yehoshua Sagiv,
A. Serebrenik
: TermiLog: A System for Checking Termination of Queries to Logic Programs.
CAV 1997
: 444-447
78
Naomi Lindenstrauss
, Yehoshua Sagiv: Automatic Termination Analysis of Logic Programs.
ICLP 1997
: 63-77
77
Naomi Lindenstrauss
, Yehoshua Sagiv,
A. Serebrenik
: Unfolding the Mystery of
Mergesort
.
LOPSTR 1997
: 206-225
76
Yakov A. Kogan
,
David Michaeli
, Yehoshua Sagiv,
Oded Shmueli
: Utilizing the Multiple Facets of WWW Contents.
NGITS 1997
: 0-
75
Alon Y. Levy
,
Richard Fikes
, Yehoshua Sagiv: Speeding up Inferences Using Relevance Reasoning: A Formalism and Algorithms.
Artificial Intelligence 97
(1-2): 83-136 (1997)
74
Kenneth A. Ross
, Yehoshua Sagiv: Monotonic Aggregation in Deductive Database.
JCSS 54
(1): 79-97 (1997)
73
Hector Garcia-Molina
,
Yannis Papakonstantinou
,
Dallan Quass
,
Anand Rajaraman
, Yehoshua Sagiv,
Jeffrey D. Ullman
,
Vasilis Vassalos
,
Jennifer Widom
: The TSIMMIS Approach to Mediation: Data Models and Languages.
JIIS 8
(2): 117-132 (1997)
72
Joachim Biskup
,
Ralf Menzel
,
Torsten Polle
, Yehoshua Sagiv: Decomposition of Relationships through Pivoting.
ER 1996
: 28-41
71
Dallan Quass
,
Anand Rajaraman
, Yehoshua Sagiv,
Jeffrey D. Ullman
,
Jennifer Widom
: Querying Semistructured Heterogeneous Information.
DOOD 1995
: 319-344
70
Hector Garcia-Molina
,
Dallan Quass
,
Yannis Papakonstantinou
,
Anand Rajaraman
, Yehoshua Sagiv,
Jeffrey D. Ullman
,
Jennifer Widom
: The TSIMMIS Approach to Mediation: Data Models and Languages.
NGITS 1995
: 0-
69
Anand Rajaraman
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Answering Queries Using Templates with Binding Patterns.
PODS 1995
: 105-112
68
Alon Y. Levy
, Yehoshua Sagiv: Semantic Query Optimization in Datalog Programs.
PODS 1995
: 163-173
67
Alon Y. Levy
,
Alberto O. Mendelzon
, Yehoshua Sagiv,
Divesh Srivastava
: Answering Queries Using Views.
PODS 1995
: 95-104
66
Joachim Biskup
,
Pratul Dublish
, Yehoshua Sagiv: Optimization of a Subclass of Conjunctive Queries.
Acta Informatica 32
(1): 1-26 (1995)
65
Yehoshua Sagiv: Editor's Forword.
JCSS 51
(1): 1 (1995)
64
Jeffrey F. Naughton
,
Raghu Ramakrishnan
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Argument Reduction by Factoring.
TCS 146
(1&2): 269-310 (1995)
63
Jennifer Widom
,
Ashish Gupta
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Validating Constraints with Partial Information: Research Overview.
DAISD 1994
: 375-385
62
Ashid Gupta
, Yehoshua Sagiv,
Jeffrey D. Ullman
,
Jennifer Widom
: Constraint Checking with Partial Information.
PODS 1994
: 45-55
61
Ashish Gupta
, Yehoshua Sagiv,
Jeffrey D. Ullman
,
Jennifer Widom
: Efficient and Complete Tests for Database Integrity Constraint Checking.
PPCP 1994
: 173-180
60
Alon Y. Levy
,
Inderpal Singh Mumick
, Yehoshua Sagiv: Query Optimization by Predicate Move-Around.
VLDB 1994
: 96-107
59
Alon Y. Levy
, Yehoshua Sagiv: Exploiting Irrelevance Reasoning to Guide Problem Solving.
IJCAI 1993
: 138-145
58
Yehoshua Sagiv: Tools for Deductive Databases (Abstract).
LPNMR 1993
: 333
57
Alon Y. Levy
,
Inderpal Singh Mumick
, Yehoshua Sagiv,
Oded Shmueli
: Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions.
PODS 1993
: 109-122
56
Alon Y. Levy
, Yehoshua Sagiv: Queries Independent of Updates.
VLDB 1993
: 171-181
55
Haim Gaifman
,
Harry G. Mairson
, Yehoshua Sagiv,
Moshe Y. Vardi
: Undecidable Optimization Problems for Database Logic Programs.
JACM 40
(3): 683-713 (1993)
54
Raghu Ramakrishnan
, Yehoshua Sagiv,
Jeffrey D. Ullman
,
Moshe Y. Vardi
: Logical Query Optimization by Proff-Tree Transformation.
JCSS 47
(1): 222-248 (1993)
53
Yehoshua Sagiv,
Oded Shmueli
: Solving Queries by Tree Projections.
TODS 18
(3): 487-511 (1993)
52
Kenneth A. Ross
, Yehoshua Sagiv: Monotonic Aggregation in Deductive Databases.
PODS 1992
: 114-126
51
Alon Y. Levy
, Yehoshua Sagiv: Constraints and Redundancy in Datalog.
PODS 1992
: 67-80
50
Michael Kifer
,
Won Kim
, Yehoshua Sagiv: Querying Object-Oriented Databases.
SIGMOD Conference 1992
: 393-402
49
Alon Y. Levy
,
Inderpal Singh Mumick
, Yehoshua Sagiv,
Oded Shmueli
: Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions.
Workshop on Deductive Databases, JICSLP 1992
: 1-10
48
Yehoshua Sagiv: On Testing Effective Computability of Magic Programs.
DOOD 1991
: 244-262
47
Yehoshua Sagiv: A Termination Test for Logic Programs.
ISLP 1991
: 518-532
46
Alexander Brodsky
, Yehoshua Sagiv: Inference of Inequality Constraints in Logic Programs.
PODS 1991
: 227-240
45
Yehoshua Sagiv: Evaluation of Queries in Independent Database Schemes.
JACM 38
(1): 120-161 (1991)
44
Jeffrey F. Naughton
, Yehoshua Sagiv: A Simple Characterization of Uniform Boundedness for a Class of Recursions.
JLP 10
(1/2/3&4): 233-252 (1991)
43
Pratul Dublish
,
Joachim Biskup
, Yehoshua Sagiv: Optimizatioin of a Subclass of Conjunctive Queries.
ICDT 1990
: 455-469
42
Yehoshua Sagiv: Is There Anything Better than Magic?
NACLP 1990
: 235-254
41
Alexander Brodsky
, Yehoshua Sagiv: On Termination of Datalog Programs.
DOOD 1989
: 47-64
40
Yehoshua Sagiv,
Moshe Y. Vardi
: Safety of Datalog Queries over Infinite Databases.
PODS 1989
: 160-171
39
Raghu Ramakrishnan
, Yehoshua Sagiv,
Jeffrey D. Ullman
,
Moshe Y. Vardi
: Proof-Tree Transformation Theorems and Their Applications.
PODS 1989
: 172-181
38
Alexander Brodsky
, Yehoshua Sagiv: Inference of Monotonicity Constraints in Datalog Programs.
PODS 1989
: 190-199
37
Jeffrey F. Naughton
,
Raghu Ramakrishnan
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules.
SIGMOD Conference 1989
: 235-242
36
Jeffrey F. Naughton
,
Raghu Ramakrishnan
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Argument Reduction by Factoring.
VLDB 1989
: 173-182
35
Witold Litwin
, Yehoshua Sagiv,
K. Vidyasankar
: Concurrency and Trie Hashing.
Acta Informatica 26
(7): 597-614 (1989)
34
Foto N. Afrati
,
Christos H. Papadimitriou
,
George Papageorgiou
,
Athena Roussou
, Yehoshua Sagiv,
Jeffrey D. Ullman
: On the Convergence of Query Evaluation.
JCSS 38
(2): 341-359 (1989)
33
Yehoshua Sagiv,
Oded Shmueli
: A Characterization of Finite fd-Acyclicity.
JCSS 38
(2): 380-404 (1989)
32
Yehoshua Sagiv: Optimizing Datalog Programs.
Foundations of DD and LP 1988
: 659-698
31
Yehoshua Sagiv: On Bounded Database Schemes and Bounded Horn-Clause Programs.
SIAM J. Comput. 17
(1): 1-22 (1988)
30
Haim Gaifman
,
Harry G. Mairson
, Yehoshua Sagiv,
Moshe Y. Vardi
: Undecidable Optimization Problems for Database Logic Programs.
LICS 1987
: 106-115
29
Jeffrey F. Naughton
, Yehoshua Sagiv: A Decidable Class of Bounded Recursions.
PODS 1987
: 227-236
28
Yehoshua Sagiv: Optimizing Datalog Programs.
PODS 1987
: 349-362
27
Yehoshua Sagiv,
Claude Delobel
,
D. Stott Parker
,
Ronald Fagin
: Correction to ``An Equivalence between Relational Database Dependencies and a Fragment of Propositional Logic''.
JACM 34
(4): 1016-1018 (1987)
26
François Bancilhon
,
David Maier
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Magic Sets and Other Strange Ways to Implement Logic Programs.
PODS 1986
: 1-16
25
Yehoshua Sagiv,
Oded Shmueli
: The Equivalence of Solving Queries and Production Tree Projections.
PODS 1986
: 160-172
24
Yehoshua Sagiv,
Oded Shmueli
: On Finite FD-Acyclicity.
PODS 1986
: 173-182
23
Foto N. Afrati
,
Christos H. Papadimitriou
,
George Papageorgiou
,
Athena Roussou
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Convergence of Sideways Query Evaluation.
PODS 1986
: 24-30
22
Yehoshua Sagiv: Concurrent Operations on B*-Trees with Overtaking.
JCSS 33
(2): 275-296 (1986)
21
Yehoshua Sagiv: On Computing Restricted Projections of Representative Instances.
PODS 1985
: 171-180
20
Yehoshua Sagiv: Concurrent Operations on B-Trees with Overtaking.
PODS 1985
: 28-37
19
Sharon McCure Kuck
, Yehoshua Sagiv: Designing Globally Consistent Network Schemas.
SIGMOD Conference 1983
: 185-195
18
Yehoshua Sagiv: Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions.
SIAM J. Comput. 12
(2): 316-328 (1983)
17
Yehoshua Sagiv: A Characterization of Globally Consistent Databases and Their Correct Access Paths.
TODS 8
(2): 266-286 (1983)
16
Sharon McCure Kuck
, Yehoshua Sagiv: A Universal Relation Database System Implemented via the Network Model.
PODS 1982
: 147-157
15
Yehoshua Sagiv,
Scott F. Walecka
: Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies.
JACM 29
(1): 103-117 (1982)
14
Yehoshua Sagiv: Can We Use the Universal Instance Assumption Without Using Nulls?
SIGMOD Conference 1981
: 108-120
13
Yehoshua Sagiv,
Claude Delobel
,
D. Stott Parker
,
Ronald Fagin
: An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic.
JACM 28
(3): 435-453 (1981)
12
David Maier
, Yehoshua Sagiv,
Mihalis Yannakakis
: On the Complexity of Testing Implications of Functional and Join Dependencies.
JACM 28
(4): 680-695 (1981)
11
Catriel Beeri
,
Alberto O. Mendelzon
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Equivalence of Relational Database Schemes.
SIAM J. Comput. 10
(2): 352-370 (1981)
10
Alfred V. Aho
, Yehoshua Sagiv,
Thomas G. Szymanski
,
Jeffrey D. Ullman
: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions.
SIAM J. Comput. 10
(3): 405-421 (1981)
9
Yehoshua Sagiv: An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic.
JACM 27
(2): 250-262 (1980)
8
Yehoshua Sagiv,
Mihalis Yannakakis
: Equivalences Among Relational Expressions with the Union and Difference Operators.
JACM 27
(4): 633-655 (1980)
7
David Maier
,
Alberto O. Mendelzon
, Yehoshua Sagiv: Testing Implications of Data Dependencies (Abstract).
SIGMOD Conference 1979
: 152
6
Catriel Beeri
,
Alberto O. Mendelzon
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Equivalence of Relational Database Schemes.
STOC 1979
: 319-329
5
Alfred V. Aho
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Equivalences Among Relational Expressions.
SIAM J. Comput. 8
(2): 218-246 (1979)
4
Alfred V. Aho
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Efficient Optimization of a Class of Relational Expressions.
TODS 4
(4): 435-454 (1979)
3
David Maier
,
Alberto O. Mendelzon
, Yehoshua Sagiv: Testing Implications of Data Dependencies.
TODS 4
(4): 455-469 (1979)
2
Alfred V. Aho
, Yehoshua Sagiv,
Jeffrey D. Ullman
: Efficient Optimization of a Class of Relational Expressions (Abstract).
SIGMOD Conference 1978
: 39
1
Yehoshua Sagiv,
Mihalis Yannakakis
: Equivalence among Relational Expressions with the Union and Difference Operation.
VLDB 1978
: 535-548
Copyright(C) 2000 ACM | | | | | | |
