3 citations found. Retrieving documents...
Sybase Corporation. Sybase IQ 11.2.1, 1997.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Cache Conscious Indexing for Decision-Support in Main Memory - Rao, Ross (1999)   (19 citations)  (Correct)

....contrasts the requirements of OLAP with OLTP systems and contends that the real performance gains can be obtained by separating the two systems. A dedicated OLAP system can have a much better query performance if we are willing to sacrifice update performance. Commercial systems such as Sybase IQ [Syb97] were designed for such purposes. Thus, typical OLAP workloads are query intensive, and have infrequent batch updates. For example, a data warehouse for a university, containing all the student records, is probably updated once per day. Census data sets are collected periodically and will remain ....

Sybase Corporation. Sybase IQ 11.2.1, 1997.


Reusing Invariants: A New Strategy for Correlated Queries - Jun Rao (1998)   (11 citations)  (Correct)

....rows one by one and close( cleans up everything. Most relational database systems have analogous operator based execution engines. We ll call this type of query engine a data flow engine and the execution plan a data flow tree. We implemented the invariant optimization technique on Sybase IQ s [Syb97b] data flow engine and join optimizer. It took only 3 manmonths to have our technique seamlessly incorporated into the existing system. The technique will be present in an upcoming commercial version of Sybase IQ. The rest of the paper is organized as follows: In Section 2, we describe the ....

....There is another possible optimization technique that is orthogonal to the invariant optimization. We can avoid invoking the subquery on duplicate outer reference values by using the subquery memoization technique [Mic68] which has already been implemented in several commercial systems [Syb97a, Syb97b] There are two possible ways to do that. The first is to build a main memory hash table on the subquery node. Every time we evaluate a subquery, we first probe the hash table based on the values of the outer references for that iteration. If the outer reference don t exist, we insert the values ....

Sybase Corporation. Sybase IQ 11.2.1, 1997.


Adapting Materialized Views After Redefinitions: . . . - Gupta, al. (1995)   (55 citations)  (Correct)

No context found.

Sybase Corporation. Sybase IQ 11.2.1, 1997.

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