| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Sumit Ganguly Lakshminath Bhuvanagiri , Sumit Ganguly, Deepanjan Kesh , Chandan Saha : Simpler algorithm for estimating frequency moments of data streams. SODA 2006 : 708-713 Sumit Ganguly, Deepanjan Kesh , Chandan Saha : Practical Algorithms for Tracking Database Join Sizes. FSTTCS 2005 : 297-309 Sumit Ganguly: Counting Distinct Items over Update Streams. ISAAC 2005 : 505-514 Sumit Ganguly, Minos N. Garofalakis , Amit Kumar , Rajeev Rastogi : Join-distinct aggregate estimation over update streams. PODS 2005 : 259-270 Sumit Ganguly: Estimating Frequency Moments of Data Streams Using Random Linear Combinations. APPROX-RANDOM 2004 : 369-380 Sumit Ganguly, Minos N. Garofalakis , Rajeev Rastogi : Processing Data-Stream Join Aggregates Using Skimmed Sketches. EDBT 2004 : 569-586 Abhinandan Das , Sumit Ganguly, Minos N. Garofalakis , Rajeev Rastogi : Distributed Set Expression Cardinality Estimation. VLDB 2004 : 312-323 Sumit Ganguly, Minos N. Garofalakis , Rajeev Rastogi : Tracking set-expression cardinalities over continuous update streams. VLDB J. 13 (4): 354-369 (2004) Sumit Ganguly, Minos N. Garofalakis , Rajeev Rastogi : Processing Set Expressions over Continuous Update Streams. SIGMOD Conference 2003 : 265-276 Philip Bohannon , Xin Dong , Sumit Ganguly, Henry F. Korth , Chengkai Li , P. P. S. Narayan , Pradeep Shenoy : ROLEX: Relational On-Line Exchange with XML. SIGMOD Conference 2003 : 673 Sourav Chatterji , Sai Surya Kiran Evani , Sumit Ganguly, Mahesh Datt Yemmanuru : On the Complexity of Approximate Query Optimization. PODS 2002 : 282-292 Philip Bohannon , Sumit Ganguly, Henry F. Korth , P. P. S. Narayan , Pradeep Shenoy : Optimizing View Queries in ROLEX to Support Navigable Result Trees. VLDB 2002 : 119-130 Filippo Furfaro , Sergio Greco , Sumit Ganguly, Carlo Zaniolo : Pushing extrema aggregates to optimize logic queries. Inf. Syst. 27 (5): 321-343 (2002) Sergio Greco , Carlo Zaniolo , Sumit Ganguly: Optimization of Logic Queries with MIN and MAX Predicates. FQAS 1998 : 188-202 Sumit Ganguly: Design and Analysis of Parametric Query Optimization Algorithms. VLDB 1998 : 228-238 Sumit Ganguly, Akshay Goel , Abraham Silberschatz : Efficient and Acurate Cost Models for Parallel Query Optimization. PODS 1996 : 172-181 Sumit Ganguly, Phillip B. Gibbons , Yossi Matias , Abraham Silberschatz : Bifocal Sampling for Skew-Resistant Join Size Estimation. SIGMOD Conference 1996 : 271-281 Sumit Ganguly, Apostolos Gerasoulis , Weining Wang : Partitioning Pipelines with Communication Costs. CISMOD 1995 : 302-320 Sumit Ganguly, Abraham Silberschatz , Shalom Tsur : Mapping Datalog Program Execution to Networks of Procesors. IEEE Trans. Knowl. Data Eng. 7 (3): 351-361 (1995) Sumit Ganguly, Sergio Greco , Carlo Zaniolo : Extrema Predicates in Deductive Databases. J. Comput. Syst. Sci. 51 (2): 244-259 (1995) Sumit Ganguly, Ravi Krishnamurthy : Parametric Distributed Query Optimization based on Load Conditions. COMAD 1994 : 0- Rafael Alonso , Sumit Ganguly: Query Optimization for Energy Efficiency in Mobile Environments. FMLDO 1993 : 1-17 Sergio Greco , Carlo Zaniolo , Sumit Ganguly: Greedy by Choice. PODS 1992 : 105-113 Sumit Ganguly, Waqar Hasan , Ravi Krishnamurthy : Query Optimization for Parallel Execution. SIGMOD Conference 1992 : 9-18 Sumit Ganguly, Abraham Silberschatz , Shalom Tsur : Parallel Bottom-Up Processing of Datalog Queries. J. Log. Program. 14 (1&2): 101-126 (1992) Sumit Ganguly: Parallel Evaluation of Deductive Database Queries. University of Texas, Austin 1992 Sumit Ganguly, Ravi Krishnamurthy , Abraham Silberschatz : An Analysis Technique for Transitive Closure Algorithms: A Statistical Approach. ICDE 1991 : 728-735 Sumit Ganguly, Sergio Greco , Carlo Zaniolo : Minimum and Maximum Predicates in Logic Programming. PODS 1991 : 154-163 Sumit Ganguly, Abraham Silberschatz , Shalom Tsur : A Framework for the Parallel Processing of Datalog Queries. SIGMOD Conference 1990 : 143-152 1 [ 8 ] 2 [ 29 ] 3 [ 18 ] [ 20 ] 4 [ 19 ] 5 [ 23 ] 6 [ 20 ] 7 [ 19 ] 8 [ 17 ] 9 [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 26 ] 10 [ 12 ] 11 [ 13 ] 12 [ 14 ] 13 [ 2 ] [ 7 ] [ 10 ] [ 16 ] [ 17 ] 14 [ 6 ] 15 [ 28 ] [ 29 ] 16 [ 18 ] [ 20 ] 17 [ 3 ] [ 6 ] [ 9 ] 18 [ 26 ] 19 [ 20 ] 20 [ 13 ] 21 [ 18 ] [ 20 ] 22 [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 26 ] 23 [ 28 ] [ 29 ] 24 [ 18 ] [ 20 ] 25 [ 1 ] [ 3 ] [ 5 ] [ 11 ] [ 13 ] [ 14 ] 26 [ 1 ] [ 5 ] [ 11 ] 27 [ 12 ] 28 [ 19 ] 29 [ 2 ] [ 7 ] [ 10 ] [ 16 ] [ 17 ]  ©2006 Association for Computing Machinery |
