ppt-universityofhouston.pptVIP

A Benchmark to compute # of paths in a graph of length k */79 Cube computation with UDF (table function) Data structure in RAM; maybe one pass It requires maximal cuboid or choosing k dimensions */79 Cube in UDFLattice manipulated with hash table */79 Cube visualization: harder than 2D or 3D data! Lattice exploration Projection into 2D Comparing cuboids */79 Cube interpretation visualizationstatistical tests on cubes Can we do “search engines”?Keyword search, ranking Acknowledgments Il-Yeol Song, since we met in 2010, but I started sending papers to DOLAP in 2003 Mike Stonebraker: one si