| Login | Create Account |
Items where Project is "TSIMMIS" and Year is 2001
Jump to: Generating Efficient Plans for Queries Using Views | Generating Efficient Plans for Queries Using Views (Full Version) | Minimizing View Sets without Losing Query-Answering Power | Minimizing View Sets without Losing Query-Answering Power (Extended version): Efficient view materialization in data integration and warehousing | On Answering Queries in the Presence of Limited Access Patterns Number of items: 5.
Generating Efficient Plans for Queries Using ViewsAfrati, Foto and Li, Chen and Ullman, Jeff (2001) Generating Efficient Plans for Queries Using Views. In: International Conference on Management of Data (SIGMOD 2001), May 21-24, 2001, Santa Barbara, California. Generating Efficient Plans for Queries Using Views (Full Version)Afrati, Foto and Li, Chen and Ullman, Jeff (2001) Generating Efficient Plans for Queries Using Views (Full Version). Technical Report. Stanford. Minimizing View Sets without Losing Query-Answering PowerLi, Chen and Bawa, Mayank and Ullman, Jeffrey D. (2001) Minimizing View Sets without Losing Query-Answering Power. In: 8th International Conference on Database Theory (ICDT 2001) , January 4-6, 2001, London, UK. Minimizing View Sets without Losing Query-Answering Power (Extended version): Efficient view materialization in data integration and warehousingLi, Chen and Bawa, Mayank and Ullman, Jeffrey D. (2001) Minimizing View Sets without Losing Query-Answering Power (Extended version): Efficient view materialization in data integration and warehousing. Technical Report. Stanford InfoLab. On Answering Queries in the Presence of Limited Access PatternsLi, Chen and Chang, Edward (2001) On Answering Queries in the Presence of Limited Access Patterns. In: 8th International Conference on Database Theory (ICDT 2001) , January 4-6, 2001, London, UK. |
