Academic
Publications
Database System Implementation

Database System Implementation,Hector Garcia-molina,Jeffrey D. Ullman,Jennifer Widom

Database System Implementation   (Citations: 191)
BibTex | RIS | RefWorks Download
Published in 2000.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...We apply sample-based join cost estimation method and cost-based join order selection method [14] to select the join order on each computer...

    Zhao Sunet al. Efficient subgraph matching on billion node graphs

    • ...Typical geospatial queries [18] include partial matching queries, range queries, nearest-neighbor queries and where-am-I queries...

    Suprio Rayet al. Jackpine: A benchmark to evaluate spatial database performance

    • ...Many work attempt to address the problem of statistics automatically e.g. in [5] and [6]...

    Prariwat Kwanglatet al. Query transformation for exact cardinality computing

    • ...The architecture has been implemented in Java, using the XXL [7] libraries to access secondary storage, and a greedy algorithm to order joins based on predicted intermediate result sizes [11]...

    Kwanchai Eurviriyanukulet al. Adaptive join processing in pipelined plans

    • ...Common items extraction from sorted lists is a classical problem in computer science and has a wide range of applications in many different disciplines [1], [2], [3], [4], [5], [6], [7], such as:  Joins using sorted indexes Assuming that we have n relations R1(X, Y1), ... , Rn(X, Yn) with indexes on X for all relations, we want to compute R1(X, Y1) �� . . . �� Rn(X, Yn)...
    • ...Example 1: Suppose there exist four ordered lists, shown in Figure 1. According to the algorithm described in [1], in order to obtain the common items of the lists, we start with the first items of the lists, which are 2, 3, 80, 5. If the current items are equal, then we know that the current item is one of the common items...
    • ...In this section, we first give a basic algorithm, MergeAll [1], to solve our problem...
    • ...<{[SECTION]}>lem has been studied in [1], [8], [9], [10]...
    • ...<{[SECTION]}>lem has been studied in [1], [8], [9], [10]. In [1], they propose...

    Wei Luet al. Efficient Common Items Extraction from Multiple Sorted Lists

Sort by: