Method using a hierarchy of servers for query processing of...

Details Method using a hierarchy of servers for query processing of... Method using a hierarchy of servers for query processing of...

2011-04-05

2011-04-05

Timblin, Robert (Department: 2167)

Data processing: database and file management or data structures

Database and file access

Record, file, and data search and comparisons

C707S972000, C709S215000

Reexamination Certificate

active

07921131

ABSTRACT:
An improved system and method for query processing in a distributed column chunk data store is provided. A distributed column chunk data store may be provided by multiple storage servers operably coupled to a network. A storage server provided may include a database engine for partitioning a data table into the column chunks for distributing across multiple storage servers, a storage shared memory for storing the column chunks during processing of semantic operations performed on the column chunks, and a storage services manager for striping column chunks of a partitioned data table across multiple storage servers. Query processing may be performed by storage servers or query processing servers operably coupled by a network to storage servers in the column chunk data store. To do so, a hierarchy of servers may be dynamically determined to process execution steps of a query transformed for distributed processing.

REFERENCES:
patent: 5502811 (1996-03-01), Ripberger
patent: 5560005 (1996-09-01), Hoover
patent: 5657468 (1997-08-01), Stallmo
patent: 5768532 (1998-06-01), Megerian
patent: 5794229 (1998-08-01), French
patent: 5845279 (1998-12-01), Garofalakis et al.
patent: 5870739 (1999-02-01), Davis
patent: 5903887 (1999-05-01), Kleewein et al.
patent: 6067548 (2000-05-01), Cheng
patent: 6131095 (2000-10-01), Low et al.
patent: 6151641 (2000-11-01), Herbert
patent: 6356892 (2002-03-01), Corn et al.
patent: 6449730 (2002-09-01), Mann
patent: 6694306 (2004-02-01), Nishizawa et al.
patent: 7174293 (2007-02-01), Kenyon
patent: 7308532 (2007-12-01), Wood
patent: 7315958 (2008-01-01), Bridge
patent: 7447839 (2008-11-01), Uppala
patent: 7447865 (2008-11-01), Uppala
patent: 7457935 (2008-11-01), Uppala
patent: 7464247 (2008-12-01), Uppala
patent: 7546321 (2009-06-01), Uppala
patent: 7587569 (2009-09-01), Uppala
patent: 2002/0091715 (2002-07-01), Coady
patent: 2002/0120763 (2002-08-01), Miloushev et al.
patent: 2002/0152293 (2002-10-01), Hahn
patent: 2002/0174295 (2002-11-01), Ulrich
patent: 2002/0194157 (2002-12-01), Zait
patent: 2003/0028509 (2003-02-01), Sah et al.
patent: 2003/0074348 (2003-04-01), Sinclair
patent: 2003/0187864 (2003-10-01), McGoveran
patent: 2003/0217033 (2003-11-01), Sandler et al.
patent: 2003/0220951 (2003-11-01), Muthulingam
patent: 2004/0003086 (2004-01-01), Parham
patent: 2004/0153479 (2004-08-01), Mikesell
patent: 2005/0015546 (2005-01-01), Zohar et al.
patent: 2005/0187977 (2005-08-01), Frost
patent: 2005/0210082 (2005-09-01), Shutt
patent: 2005/0216428 (2005-09-01), Yagawa
patent: 2006/0089935 (2006-04-01), Clifford
patent: 2006/0107096 (2006-05-01), Findleton
patent: 2007/0143248 (2007-06-01), Uppala
patent: 2007/0143259 (2007-06-01), Uppala
patent: 2007/0143261 (2007-06-01), Uppala
patent: 2007/0143311 (2007-06-01), Uppala
patent: 2007/0143369 (2007-06-01), Uppala
Hoffer et al. “Modern Database Management”, Apr. 2004, Prentice Hall, 7th edition, 43 selected pages.
Bernardino, J. and Madeira, H. Experimental evaluation of a new distributed partitioning technique for data warehouses, Database Engineering & Applications, 2001 International Symposium on. [online], Jul. 2001 [retrieved on Jan. 13, 2010]. Retrieved from Internet:<URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=00938099&tag=1> pp. 312-321.
Bernardino, J. R. et al. Approximate Query Answering Using Data Warehouse Striping, Journal of Intelligent Information Systems [online], Sep. 2002 [retrieved on Jan. 13, 2010]. Retrieved from Internet:<URL: http://www.springerlink.com/content/m216155r6x0h2751/fulltext.pdf> pp. 145-167.
Agrawal, S et al, “Integrating Vertical and Horizontal Partitioning into Automated Physical Database Design,”SIGMOD2004, Jun. 13-18, 2004, Paris, France.
Dr. Math, “Ask Dr. Math Subject: Multiplying beyond Floating point calculations” Drexel University Aug. 9, 2003.
Rankins et al., “Microsoft SQ1 Server 2000 Unleashed”, Dec. 12, 2001,Sams, 2 Pages, Dec. 12, 2001.
Roth et al, “Database Compression,”SIGMOD Record, 22:3, Sep. 1993 p. 31-39.
Office Action for U.S. Appl. No. 11/305,916, Jan. 28, 2008.
Office Action for U.S. Appl. No. 11/305,916, Jul. 11, 2008.
Office Action for U.S. Appl. No. 11/305,916, Nov. 28, 2008.
Office Action for U.S. Appl. No. 11/305,916, Mar. 3, 2009.
Office Action for U.S. Appl. No. 11/305,916, Jun. 29, 2009.
Office Action for U.S. Appl. No. 11/305,916, Nov. 23, 2009.
Office Action for U.S. Appl. No. 11/305,916, Mar. 10, 2010.
Office Action for U.S. Appl. No. 11/305,916, May 28, 2010.
Office Action for U.S. Appl. No. 11/305,963, Jan. 6, 2009.
Office Action for U.S. Appl. No. 11/305,963, Sep. 4, 2008.
Office Action for U.S. Appl. No. 11/311,510, Sep. 17, 2008.
Office Action for U.S. Appl. No. 11/311,510, Apr. 30, 2008.
Office Action for U.S. Appl. No. 11/266,606, Nov. 1, 2007.
Office Action for U.S. Appl. No. 11/266,667, Dec. 11, 2007.
Office Action for U.S. Appl. No. 11/266,667, Jul. 31, 2007.
Office Action for U.S. Appl. No. 11/266,668, Feb. 20, 2008.
Office Action for U.S. Appl. No. 11/266,668, Oct. 1, 2007.
Office Action for U.S. Appl. No. 11/305,998, Jul. 12, 2010.
Office Action for U.S. Appl. No. 11/305,998, Jan. 22, 2010.
Office Action for U.S. Appl. No. 11/305,998, Aug. 17, 2009.
Office Action for U.S. Appl. No. 11/305,998, Apr. 15, 2009.
Office Action for U.S. Appl. No. 11/305,998, Dec. 24, 2008.
Office Action for U.S. Appl. No. 11/305,998, Jul. 3, 2008.
Office Action for U.S. Appl. No. 11/305,998, Jan. 9, 2008.
Office Action for U.S. Appl. No. 11/305,997, Feb. 17, 2010.
Office Action for U.S. Appl. No. 11/305,997, Aug. 3, 2009.
Office Action for U.S. Appl. No. 11/305,997, Mar. 25, 2009.
Office Action for U.S. Appl. No. 11/305,997, Oct. 16, 2008.
Office Action for U.S. Appl. No. 11/305,997, May 12, 2008.
Office Action for U.S. Appl. No. 11/305,997, Dec. 31, 2007.
Office Action for U.S. Appl. No. 11/305,915, Feb. 19, 2010.
Office Action for U.S. Appl. No. 11/305,915, Aug. 12, 2009.
Office Action for U.S. Appl. No. 11/305,915, Mar. 31, 2009.
Office Action for U.S. Appl. No. 11/305,915, Oct. 16, 2008.
Office Action for U.S. Appl. No. 11/305,915, May 8, 2008.
Office Action for U.S. Appl. No. 11/305,915, Dec. 31, 2007.
Office Action for U.S. Appl. No. 11/311,825, May 27, 2009.
Office Action for U.S. Appl. No. 11/311,825, Aug. 4, 2008.
Office Action for U.S. Appl. No. 11/311,825, Feb. 1, 2008.
Office Action for U.S. Appl. No. 11/311,825, Mar. 31, 2010.
Office Action for U.S. Appl. No. 11/311,825, Oct. 26, 2009.
Office Action for U.S. Appl. No. 11/311,825, Jan. 16, 2009.
Hartman, J. et al., “The Zebra Striped Network File System,”ACM Transactions on Computer Systems(TOCS), vol. 13, Issue 3, Aug. 1995.
Musumeci, G. et al., System Performance Tuning, retrieved on Jul. 21, 2010, Retrieved from the Internet <URL: http://proquest.safaribooksonline.com/0-596-00284-X> Chapter 6, Feb. 2002.
Office Action for U.S. Appl. No. 11/305,916, Sep. 23, 2010.
Office Action for U.S. Appl. No. 11/305,916, Nov. 3, 2010.
Office Action for U.S. Appl. No. 11/305,998, Sep. 13, 2010.
Office Action for U.S. Appl. No. 11/305,997, Jul. 28, 2010.

Affiliated with

Also associated with

Rating

Method using a hierarchy of servers for query processing of... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method using a hierarchy of servers for query processing of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method using a hierarchy of servers for query processing of... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2664463