Ultra-shared-nothing parallel database

Details Ultra-shared-nothing parallel database Ultra-shared-nothing parallel database

2005-02-17

2010-10-19

Fleurantin, Jean B (Department: 2162)

Data processing: database and file management or data structures

Database design

Database and data structure management

C707S808000, C711S172000

Reexamination Certificate

active

07818349

ABSTRACT:
An ultra-shared-nothing parallel database system includes at least one master node and multiple slave nodes. A database consisting of at least one fact table and multiple dimension tables is partitioned and distributed across the slave nodes of the database system so that queries are processed in parallel without requiring the transfer of data between the slave nodes. The fact table and a first dimension table of the database are partitioned across the slave nodes. The other dimension tables of the database are duplicated on each of the slave nodes and at least one of these other dimension tables is partitioned across the slave nodes.

REFERENCES:
patent: 5590284 (1996-12-01), Crosetto
patent: 5737549 (1998-04-01), Hersch et al.
patent: 5848408 (1998-12-01), Jakobsson et al.
patent: 5864857 (1999-01-01), Ohata et al.
patent: 5909681 (1999-06-01), Passera et al.
patent: 6092062 (2000-07-01), Lohman et al.
patent: 6968335 (2005-11-01), Bayliss et al.
patent: 7085769 (2006-08-01), Luo et al.
patent: WO 02/25481 (2002-03-01), None
patent: WO 02/25557 (2002-03-01), None
Jin-Ho Kim et al., An efficient processing of queries with joins and aggregate functions in data warehousing environment, Dec. 10, 2002, IEEE, 785-791.
Bellatreche et al., What can partitioning do for your data warehouses and data marts?, Aug. 6, 2002, IEEE, 437-445.
Baru et al., “DB2 Parallel Edition,”IBM Systems Journal, 34(2):292-322 (1995).
Dewitt et al., “The Gamma Database Machine Project,” Computer Sciences Technical Report 921, University of Wisconsin-Madison, Mar. 1990, pp. 1-39.
Dewitt et al., “Multiprocessor Hash-Based Join Algorithms,”Proceedings of 11thInt'l Conf. on Very Large Data Bases, Stockholm, Sweden, vol. 11, pp. 151-164 (1985).
Dewitt et al., “Parallel Database Systems: The Future of High Performance Database Processing,”Communications of the ACM, vol. 36(6):1-26 (Jun. 1992).
Epstein, Robert S., “Query Processing Techniques for Distributed, Relational Data Base Systems,”Computer Science: Distributed Database Systems, No. 13, Harold S. Stone ed.,UMI Research Press, Ann Arbor, Michigan, pp. 1-104, 1982.
Mehta et al., “Data placement in shared-nothing parallel database systems,”The VLDB Journalpp. 53-72, Feb. 1997, http://delivery.acm.org/10.1145/770000/765547/70060053.pdf?key1=765547&key2=1140469421&coll=GUIDE&d1=GUIDE&CFID=47924469&CFTOKEN=75342509, retrieved Aug. 7, 2009.
Schneider et al., “A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment,” ACM SIGMOD Record, vol. 18(2):110-121 (Jun. 1989).
Sheth et al., “Federated Database Systems for Managing Distributed, Heterogeneous, and Autonomous Databases,” ACM Computing Surveys, vol. 22(3):183-236 (Sep. 1990).
Stöhr et al., “Multi-Dimensional Database Allocation for Parallel Data Warehouses,”Proc. 26thInt'l Conference on Very Large Data Bases, Cairo Egypt 2000, pp. 273-284, http://www.sigmod.org/v l db/conf/2000/P273.pdf, retrieved Aug. 7, 2009.
Stonebraker et al., “Mariposa: A New Architecture for Distributed Data,”Proc. 10thInt'l Conference on Data Engineering, 1994, pp. 54-65.
Sun et al., “Dynamic maintenance of multidimensional range data partitioning for parallel data processing,”Proc. 1stACM Int'l. Workshop on Data Warehousing and OLAP, Washington, D.C., USA, 1998, pp. 72-79, http://doi.acm.org/10.1145/294260.294275, retrieved Aug. 7, 2009.
Supplementary European Search Report for European Patent Application No. EP 05 71 3785 dated Sep. 23, 2009.
Tamer Özsu et al., “Principles of Distributed Database Systems,” 2nded., Chapter 13, pp. 430-432 and 436-441, 1999.
Taniar et al., “Aggregate-JoinQuery Processing in Parallel Database Systems,”Proc. 4thInt'l Conference on High-Performance Computing in the Asia-Pacific Region, vol. 2, pp. 824-829 (2000).
Wolf et al., “Comparative Performance of Parallel Join Algorithms,”Proc. 1stInt'l Conference on Parallel and Distributed Information Systems, Dec. 4-6, 1991, Miami Beach, Florida, pp. 78-88.
Yu et al., “Distributed Query Processing,”Computing Surveys, vol. 16(4):399-433 (Dec. 1984).

Affiliated with

Also associated with

Rating

Ultra-shared-nothing parallel database does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Ultra-shared-nothing parallel database, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ultra-shared-nothing parallel database will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4170966