Abstract
I am a Ph.D. student in the Computer Science Department at Stanford University. My main research interests include query reformulation in the database domain. In particular, I work on the problems of how to do query planning and reformulation when relations have limited access patterns [7,9]. That is, the binding patterns of the relations require values to be specified for certain attributes in order to retrieve data from a relation. Most of my work is based on the TSIM-MIS project (http://www-db.stanford.edu/tsimmis/), a data-integration project [2,10,11] at Stanford.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi. Decidable optimization problems for database logic programs. ACM Symposium on Theory of Computing (STOC), pages 477–490, 1988.
M. R. Genesereth, A. M. Keller, and O. M. Duschka. Infomaster: An information integration system. In Proc. of ACM SIGMOD, pages 539–542, 1997.
C. Li. Computing complete answers to queries in the presence of limited access patterns (extended version). Technical report, Computer Science Dept., Stanford Univ., 1999.
C. Li. Testing query containment in the presence of binding restrictions. Technical report, Computer Science Dept., Stanford Univ. 1999.
C. Li and E. Chang. Query planning with limited source capabilities. International Conference on Data Engineering (ICDE), 2000.
C. Li, R. Yerneni, V. Vassalos, H. Garcia-Molina, Y. Papakonstantinou, J. D. Ullman, and M. Valiveti. Capability based mediation in TSIMMIS. In Proc. of ACM SIGMOD, pages 564–566, 1998.
A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In Proc. of ACM Symposium on Principles of Database Systems (PODS), pages 105–112, 1995.
O. Shmueli. Equivalence of datalog queries is undecidable. Journal of Logic Programming. 15(3):231–241, 1993.
J. D. Ullman. Principles of Database and Knowledge-base Systems, Volumes II: The New Technologies. Computer Science Press, New York, 1989.
J. D. Ullman. Information integration using logical views. International Conference on Database Theory (ICDT), pages 19–40, 1997.
G. Wiederhold. Mediators in the architecture of future information systems. IEEE Computer, 25(3):38–49, 1992.
R. Yerneni, C. Li, H. Garcia-Molina, and J. D. Ullman. Computing capabilities of mediators. In Proc. of ACM SIGMOD, pages 443–454, 1999.
R. Yerneni, C. Li, J. D. Ullman, and H. Garcia-Molina. Optimizing large join queries in mediation systems. International Conference on Database Theory (ICDT), pages 348–364, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, C. (2000). Answering Queries with Database Restrictions. In: Choueiry, B.Y., Walsh, T. (eds) Abstraction, Reformulation, and Approximation. SARA 2000. Lecture Notes in Computer Science(), vol 1864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44914-0_28
Download citation
DOI: https://doi.org/10.1007/3-540-44914-0_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67839-7
Online ISBN: 978-3-540-44914-0
eBook Packages: Springer Book Archive