4 citations found. Retrieving documents...
N. Huyn. Maintaining data warehouses under limited source access. Ph.D. Thesis, pp. 51--86, Computer Science Department, Stanford University, Sept. 1997. Also available as URL http://www-db.stanford.edu/pub/papers/ huyn-thesis.ps.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
TxnWrap: A Transactional Approach to Data Warehouse Maintenance - Chen, Rundensteiner (2000)   (Correct)

....Strobe [ZGMW96] handles multiple ISs while still assuming the schemata of all ISs to be static. SWEEP [AASY97] ensures the consistency of the data warehouse in a larger number of cases compared to Strobe [ZGMW96] 31 As a compromise between self maintenance and view maintenance via compensation, Huy97] proposes an intermediate approach to maintenance without using all the base relations but with requiring additional views to facilitate maintenance. DyDa [ZR00] addresses concurrent SCs by integrating VS, VA and VM into one system to deal with DU and SC maintenance. DyDa is a heavy weight ....

N. (Pierre) Huyn. Maintaining Data Warehouse Under Limited Source Access. PhD thesis, Stanford University, August 1997.


Complexity of Answering Queries Using Materialized Views.. - Abiteboul, Duschka (1998)   (129 citations)  (Correct)

....queries using materialized views [LMSS95, CKPS95, DG97a, BLR97, YL87, RSU95, LRU96, Ull97, DL97, Dus97, DG97b, LRO96] has been studied intensively. We propose a systematic study of its complexity. We also briefly consider the related problems of view consistency and view self maintainability [Huy97] Our results exhibit strong connections with two among the most studied problems in database theory, namely query containment [CM77, SY80, Klu88, Shm87, CV92, JK84, DS96, LS97] and incomplete information querying, e.g. IJ84, AKG91] Indeed, the works most closely related to our complexity ....

N. Huyn. Maintaining data warehouses under limited source access. Ph.D. Thesis STAN-CSTR -97-1595, Stanford University, 1997. 9


Complexity of Answering Queries Using Materialized Views - Abiteboul, Duschka (1998)   (129 citations)  (Correct)

....warehouses [28] The problem of answering queries using materialized views [24, 6, 10, 5, 43, 30, 26, 36, 12, 14, 11, 25] has been studied intensively. We propose a systematic study of its complexity. We also briefly consider the related problems of view consistency and view self maintainability [19]. Our results exhibit strong connections with two among the most studied problems in database theory, namely query containment [7, 33, 23, 31, 9, 21, 13, 27] and incomplete information querying, e.g. 20, 2] Indeed, the works most closely related to our complexity results are perhapsthose of van ....

N. Huyn. Maintaining data warehouses under limited source access. Ph.D. Thesis STAN-CS-TR-97-1595, Stanford University, 1997.


Speeding Up Materialized-View Maintenance Using Cheap Filters - At The Warehouse   Self-citation (Huyn)   (Correct)

....are only su#cient, trading completeness for e#ciency. Section 5 discusses performance of the method we propose in this paper for maintaining views. We summarize the results and discuss future work in Section 6. Throughout this paper, results are presented without their proof, which can be found in [Huy97b]. 2 E#cient Solution for CQ Views with no Self Joins This section considers the class of views defined by CQ s with no self joins, and only insertions or deletions to a single base relation. For this class, it turns out that testing VSM under insertions has a surprisingly simple solution that ....

....or deletions to a single base relation. For this class, it turns out that testing VSM under insertions has a surprisingly simple solution that can be described entirely by how variables are shared among the subgoals in the body of the view definition. For further details, we refer the reader to [Huy97b]. To help analyze how these variables are used, we will introduce the notion of subgoal partitioning, and then present the solution in terms of this notion. But first, let us define some notation and terminology used in this section and later sections. Without loss of generality, the definition ....

[Article contains additional citation context not shown here]

N. Huyn. Maintaining data warehouses under limited source access. Ph.D. Thesis, pp. 51--86, Computer Science Department, Stanford University, Sept. 1997. Also available as URL http://www-db.stanford.edu/pub/papers/ huyn-thesis.ps.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC