Computing complete answers to queries in the presence of limited access patterns

VLDB Journal

Volumn 12, Issue 3, 2003, Pages 211-227

  Li, Chen ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Complete answers to queries; Limited access patterns to relations; Query stability

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DATA HANDLING; DECISION SUPPORT SYSTEMS; INFORMATION RETRIEVAL;

INFORMATION INTEGRATION;

DATABASE SYSTEMS;

EID: 0142231580     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-002-0085-6     Document Type: Article

References (48)

1. Aho AV, Sagiv Y, Ullman JD (1979) Efficient optimization of a class of relational expressions. ACM Trans Database Syst 4(4):435-454
2. Aho AV, Sagiv Y, Ullman JD (1979) Equivalences among relational expressions. SIAM J Comput 8(2):218-246
3. Apers PMG, Hevner AR, Yao SB (1983) Optimization algorithms for distributed queries. IEEE Trans Software Eng 9(1):57-68
4. Beeri C, Ramakrishnan R (1987) On the power of magic. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Databases, pp 269-283
5. Chandra AK, Merlin PM (1977) Optimal implementation of conjunctive queries in relational data bases. ACM Symposium on Theory of Computing, pp 77-90
6. Chawathe SS, et al (1994) The TSIMMIS project: integration of heterogeneous information sources. Information Processing Society of Japan, pp 7-18
7. Cinemachine. http://www.cinemachine.com/
8. Cosmadakis SS, Gaifman H, Kanellakis PC, Vardi MY (1988) Decidable optimization problems for database logic programs. ACM Symposium on Theory of Computing, pp 477-490
9. Duschka OM (1997) Query planning and optimization in information integration. Ph.D. Thesis, Computer Science Dept., Stanford University
10. Duschka OM, Levy A (1997) Recursive plans for information gathering, In: International Joint Conference on Artificial Intelligence
11. Florescu D, Koller D, Levy AY (1997) Using probabilistic information in data integration. In: Proc. Very Large Data Bases Conference, pp 216-225
12. Florescu D, Levy A, Manolescu I, Suciu D (1999) Query optimization in the presence of limited access patterns. In: ACM SIGMOD International Conference on Management of Data, pp 311-322
13. Gaifman H, Mairson HG, Sagiv Y, Vardi MY (1993) Undecidable optimization problems for database logic programs. J ACM 40(3):683-713
14. Grädel E, Gurevich Y, Hirch C (1998) The complexity of query reliability. In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database, pp 227-234
15. Gupta A, Sagiv Y, Ullman JD, Widom J (1994) Constraint checking with partial information. In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database, pp 45-55
16. Haas LM, Kossmann D, Wimmers EL, Yang J (1997) Optimizing queries across diverse data sources. In: Proc. of Very Large Data Bases Conference, pp 276-285
17. IMDB. The Internet Movie Database Ltd. Search Engine. http://www.imdb.com/search/
18. Ioannidis Y (1985) A time bound on the materialization of some recursively defined views. In: Pirotte A, Vassiliou Y (eds) Proc. Very Large Data Bases Conference. Morgan Kaufmann, San Francisco, pp 219-226
19. Ives Z, Florescu D, Friedman M, Levy A, Weld D (1999) An adaptive query execution engine for data integration. In: ACM SIGMOD International Conference on Management of Data, pp 299-310
20. Johnson DS, Klug AC (1983) Optimizing conjunctive queries that contain untyped variables. SIAM J Comput 12(4):616-640
21. Kifer M, Li A(1988) On the semantics of rule-based expert systems with uncertainty. In: Gyssens M, Paredaens J, Gucht DV (eds) International Conference on Database Theory , Lecture Notes in Computer Science, vol. 326. Springer, Berlin Heidelberg New York, pp 102-117
22. Levy a (1996) Obtaining complete answers from incomplete databases. In: Proc. Very Large Data Bases Conference, pp 402-412
23. Levy A, Mendelzon AO, Sagiv Y, Srivastava D (1995) Answering queries using views. In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database, pp 95-104
24. Levy A, Rajaraman A, Ordille JJ (1996) Querying heterogeneous information sources using source descriptions. In: Proc. Very Large Data Bases Conference, pp 251-262
25. Li C (1999) Computing complete answers to queries in the presence of limited access patterns (extended version). Technical report, Computer Science Dept., Stanford University. http://dbpubs.stanford.edu:8090/pub/1999-11
26. Li C, Chang E (2000) Query planning with limited source capabilities. In: International Conference on Data Engineering , pp 401-412
27. Li C, Chang E (2001) Answering queries with useful bindings. ACM Trans Database Syst 26(3):313-343
28. Li C, Chang E (2001) On answering queries in the presence of limited access patterns. In: International Conference on Database Theory , pp 99-113
29. Li C, Yemeni R, Vassalos V, Garcia-Molina H, Papakonstantinou Y, Ullman JD, Valiveti M (1998) Capability based mediation in TSIMMIS. In: ACM SIGMOD International Conference on Management of Data, pp 564-566
30. Maher MJ (1993) A logic programming view of CLP. In: International Conference on Logic Programming, pp 737-753
31. Mecca G, Atzeni P, Masci A, Merialdo P, Sindoni G (1998) The Araneus web-base management system. In: ACM SIGMOD International Conference on Management of Data, pp 544-546
32. Mendelzon AO, Mihaila GA (2001) Querying partially sound and complete data sources. In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database
33. Morris KA (1988) An algorithm for ordering subgoals in NAIL! In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database, pp 82-88
34. Naughton JF, Sagiv Y (1987) A decidable class of bounded recursions. In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database, pp 227-236
35. Ono K, Lohman GM (1990) Measuring the complexity of join enumeration in query optimization. In: Proc. Very Large Data Bases Conference, pp 314-325, Morgan Kaufmann, San Francisco
36. Qian X (1996) Query folding. In: International Conference on Data Engineering, pp 48-55
37. Rajaraman A, Sagiv Y, Ullman JD (1995) Answering queries using templates with binding patterns. In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database, pp 105-112
38. Sagiv Y (1985) On computing restricted projections of representative instances. In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database, pp 171-180
39. Sagiv Y, Yannakakis M (1980) Equivalences among relational expressions with the union and difference operators. J ACM 27(4):633-655
40. Saraiya Y (1991) Subtree elimination algorithms in deductive databases. Ph.D. Thesis, Computer Science Dept., Stanford University
41. Shmueli O (1993) Equivalence of datalog queries is undecidable. J Logic Program 15(3):231-241
42. Swami AN, Gupta A (1988) Optimization of large join queries. In: ACM SIGMOD International Conference on Management of Data, pp 8-17
43. Ullman JD (1989) Principles of database and knowledge-base systems, vol. 2. The new technologies. Computer Science, New York
44. Ullman JD, Vardi MY (1988) The complexity of ordering subgoals. In: ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database, pp 74-81
45. Yan LL, Özsu MT, Liu L (1997) Accessing heterogeneous data through homogenization and integration mediators. In: International Conference on Cooperative Information Systems, pp 130-139
46. Yemeni R, Li C, Garcia-Molina H, Ullman JD (1999) Computing capabilities of mediators. In: ACM SIGMOD International Conference on Management of Data, pp 443-454
47. Yemeni R, Li C, Ullman JD, Garcia-Molina H (1999) Optimizing large join queries in mediation systems. In: International Conference on Database Theory , pp 348-364
48. Zhang X, Ozsoyoglu M (1993) On efficient reasoning with implication constraints. In: Deductive and Object-Oriented Databases, pp 236-252