![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Frederick Reiss Michael J. Franklin , Shawn R. Jeffery , Sailesh Krishnamurthy , Frederick Reiss, Shariq Rizvi , Eugene Wu , Owen Cooper , Anil Edakkunni , Wei Hong : Design Considerations for High Fan-In Systems: The HiFi Approach. CIDR 2005 : 290-304 Frederick Reiss, Joseph M. Hellerstein : Data Triage: An Adaptive Architecture for Load Shedding in TelegraphCQ. ICDE 2005 : 155-156 Owen Cooper , Anil Edakkunni , Michael J. Franklin , Wei Hong , Shawn R. Jeffery , Sailesh Krishnamurthy , Frederick Reiss, Shariq Rizvi , Eugene Wu : HiFi: A Unified Architecture for High Fan-in Systems. VLDB 2004 : 1357-1360 Sirish Chandrasekaran , Owen Cooper , Amol Deshpande , Michael J. Franklin , Joseph M. Hellerstein , Wei Hong , Sailesh Krishnamurthy , Samuel Madden , Vijayshankar Raman , Frederick Reiss, Mehul A. Shah : TelegraphCQ: Continuous Dataflow Processing for an Uncertain World. CIDR 2003 Frederick Reiss, Tapas Kanungo : A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters. SIGMOD Conference 2003 : 385-396 Sirish Chandrasekaran , Owen Cooper , Amol Deshpande , Michael J. Franklin , Joseph M. Hellerstein , Wei Hong , Sailesh Krishnamurthy , Samuel Madden , Frederick Reiss, Mehul A. Shah : TelegraphCQ: Continuous Dataflow Processing. SIGMOD Conference 2003 : 668 Sailesh Krishnamurthy , Sirish Chandrasekaran , Owen Cooper , Amol Deshpande , Michael J. Franklin , Joseph M. Hellerstein , Wei Hong , Samuel Madden , Frederick Reiss, Mehul A. Shah : TelegraphCQ: An Architectural Status Report. IEEE Data Eng. Bull. 26 (1): 11-18 (2003) 1 [ 1 ] [ 2 ] [ 4 ] 2 [ 1 ] [ 2 ] [ 4 ] [ 5 ] [ 7 ] 3 [ 1 ] [ 2 ] [ 4 ] 4 [ 5 ] [ 7 ] 5 [ 1 ] [ 2 ] [ 4 ] [ 5 ] [ 7 ] 6 [ 1 ] [ 2 ] [ 4 ] [ 6 ] 7 [ 1 ] [ 2 ] [ 4 ] [ 5 ] [ 7 ] 8 [ 5 ] [ 7 ] 9 [ 3 ] 10 [ 1 ] [ 2 ] [ 4 ] [ 5 ] [ 7 ] 11 [ 1 ] [ 2 ] [ 4 ] 12 [ 4 ] 13 [ 5 ] [ 7 ] 14 [ 1 ] [ 2 ] [ 4 ] 15 [ 5 ] [ 7 ] ![]() ©2005 Association for Computing Machinery |