Distributed redundant database

A distributed redundant database architecture for storing a plurality of files, comprising:

• a first set of processors each having a shared memory, said processors being divided into processor groups;
• a memory storage device coupled to each processor group, each memory storage device being simultaneously accessible by processors in its respective processor group;
• said plurality of files each having a plurality of records, and being assigned to said processor groups and further to said processors in each processor group to achieve a substantially even distribution;
• said plurality of files being stored in said memory storage devices of respective assigned processor groups, and further being mapped into said respective shared memories of said processors;
• and
• a database manager associated with said processor groups for managing the distribution of said plurality files to said processors, wherein each file is associated with a Red-Black Tree data structure having a plurality of nodes corresponding to a plurality of records of the file, said nodes of said Red-Black Tree being organized for speedy searches to facilitate quick location and access of corresponding records in said file.

A distributed redundant database architecture for storing a plurality of files, comprising:

• a first set of processors each having a shared memory, said processors being divided into processor groups;
• a memory storage device coupled to each processor group, each memory storage device being simultaneously accessible by processors in its respective processor group;
• said plurality of files each having a plurality of records, and being assigned to said processor groups and further to said processors in each processor group to achieve a substantially even distribution;
• said plurality of files being stored in said memory storage devices of respective assigned processor groups, and further being mapped into said respective shared memories of said processors;
• and
• a database manager associated with said processor groups for managing the distribution of said plurality files to said processors, wherein said memory storage devices are multi-port disks.

A distributed redundant database architecture for storing a plurality of files, comprising:

• a first set of processors each having a shared memory, said processors being divided into processor groups;
• a memory storage device coupled to each processor group, each memory storage device being simultaneously accessible by processors in its respective processor group;
• said plurality of files each having a plurality of records, and being assigned to said processor groups and further to said processors in each processor group to achieve a substantially even distribution;
• said plurality of files being stored in said memory storage devices of respective assigned processor groups, and further being mapped into said respective shared memories of said processors;
• and
• a database manager associated with said processor groups for managing the distribution of said plurality files to said processors, wherein said memory storage devices are coupled in a multi-initiator mode with said processor group.

A distributed redundant database architecture for storing a plurality of files, comprising:

• a first set of processors each having a shared memory, said processors being divided into processor groups;
• a memory storage device coupled to each processor group, each memory storage device being simultaneously accessible by processors in its respective processor group;
• said plurality of files each having a plurality of records, and being assigned to said processor groups and further to said processors in each processor group to achieve a substantially even distribution;
• said plurality of files being stored in said memory storage devices of respective assigned processor groups, and further being mapped into said respective shared memories of said processors;
• and
• a database manager associated with said processor groups for managing the distribution of said plurality files to said processors, wherein said memory storage device is partitioned into X filesystems, said files being generally evenly distributed among said filesystems.

A distributed redundant database architecture for a wireless communications network, comprising:

• first and second service control points, each service control point servicing one half of wireless service subscribers, each service control point including:
• a first set of processors each having a shared memory, said processors being divided into processor groups, each processor of a particular processor group having access to the shared memory of each of the other processors within the particular processor group, said processors of said processor groups being assigned subscriber files having records containing subscriber information, said files being substantially evenly distributed among said processors in each processor group;
• a pair of mirrored memory storage devices coupled to each processor group, each pair of mirrored memory storage device being accessible by its respective processor group;
• said subscriber files being stored in said pairs of mirrored memory storage devices of respective assigned processor groups, and further being mapped into said respective shared memories of said processors;
• and
• a database manager associated with said processor groups for managing the distribution of said files to said processors.

A distributed redundant database architecture for a wireless communications network, comprising:

• first and second service control points, each service control point servicing one half of wireless service subscribers, each service control point including:
• a first set of processors each having a shared memory, said processors being divided into processor groups, said processors of said processor groups being assigned subscriber files having records containing subscriber information, said files being substantially evenly distributed among said processors in each processor group;
• a pair of mirrored memory storage devices coupled to each processor group, each pair of mirrored memory storage device being accessible by its respective processor group;
• said subscriber files being stored in said pairs of mirrored memory storage devices of respective assigned processor groups, and further being mapped into said respective shared memories of said processors;
• and
• a database manager associated with said processor groups for managing the distribution of said files to said processors;
• and
• first and second database synchronization processes associated with said first and second service control points respectively for transmitting updated transient data, such as subscriber location, in said subscriber files to one another.

A distributed redundant database architecture for a wireless communications network, comprising:

• first and second service control points, each service control point servicing one half of wireless service subscribers, each service control point including:
• a first set of processors each having a shared memory, said processors being divided into processor groups, said processors of said processor groups being assigned subscriber files having records containing subscriber information, said files being substantially evenly distributed among said processors in each processor group;
• a pair of mirrored memory storage devices coupled to each processor group, each pair of mirrored memory storage device being accessible by its respective processor group;
• said subscriber files being stored in said pairs of mirrored memory storage devices of respective assigned processor groups, and further being mapped into said respective shared memories of said processors;
• and
• a database manager associated with said processor groups for managing the distribution of said files to said processors, wherein each subscriber file is associated with a Red-Black Tree data structure having a plurality of nodes corresponding to a plurality of records of the subscriber file, said nodes of said Red-Black Tree being organized for speedy searches to facilitate quick location and access of corresponding records in said subscriber file.

A distributed redundant database architecture for a wireless communications network, comprising:

• first and second service control points, each service control point servicing one half of wireless service subscribers, each service control point including:
• a first set of processors each having a shared memory, said processors being divided into processor groups, said processors of said processor groups being assigned subscriber files having records containing subscriber information, said files being substantially evenly distributed among said processors in each processor group;
• a pair of mirrored memory storage devices coupled to each processor group, each pair of mirrored memory storage device being accessible by its respective processor group;
• said subscriber files being stored in said pairs of mirrored memory storage devices of respective assigned processor groups, and further being mapped into said respective shared memories of said processors;
• and
• a database manager associated with said processor groups for managing the distribution of said files to said processors, wherein said mirrored memory storage devices are multi-port disks.

A distributed redundant database architecture for a wireless communications network, comprising:

• first and second service control points, each service control point servicing one half of wireless service subscribers, each service control point including:
• a first set of processors each having a shared memory, said processors being divided into processor groups, said processors of said processor groups being assigned subscriber files having records containing subscriber information, said files being substantially evenly distributed among said processors in each processor group;
• a pair of mirrored memory storage devices coupled to each processor group, each pair of mirrored memory storage device being accessible by its respective processor group;
• said subscriber files being stored in said pairs of mirrored memory storage devices of respective assigned processor groups, and further being mapped into said respective shared memories of said processors;
• and
• a database manager associated with said processor groups for managing the distribution of said files to said processors, wherein said mirrored memory storage devices are coupled to said processors in each processor group in a multi-initiator mode.

A distributed redundant database architecture for a wireless communications network, comprising:

• first and second service control points, each service control point servicing one half of wireless service subscribers, each service control point including:
• a first set of processors each having a shared memory, said processors being divided into processor groups, said processors of said processor groups being assigned subscriber files having records containing subscriber information, said files being substantially evenly distributed among said processors in each processor group;
• a pair of mirrored memory storage devices coupled to each processor group, each pair of mirrored memory storage device being accessible by its respective processor group;
• said subscriber files being stored in said pairs of mirrored memory storage devices of respective assigned processor groups, and further being mapped into said respective shared memories of said processors;
• and
• a database manager associated with said processor groups for managing the distribution of said files to said processors, wherein said mirrored memory storage devices are each partitioned into X filesystems, said files being generally evenly distributed among said filesystems.

A method for organizing data storage and access in a database, comprising the steps of:

• organizing data in said database into a plurality of files, each file having a file index and contain a plurality of records;
• providing a first set of processors and dividing said processors into processor groups, each processor group coupled to a memory storage device, each processor within a particular processor group having a shared memory that is accessible by every other processor within the particular processor group;
• assigning said plurality of files to said processor groups and further to said processors in each processor group in an evenly distributed manner;
• and
• storing said assigned files in said memory storage device of each processor group according to said assignment, and mapping said files assigned to each processor from said memory storage device to the shared memory of each processor.

A method for organizing data storage and access in a database, comprising the steps of:

• organizing data in said database into a plurality of files, each file having a file index and contain a plurality of records;
• providing a first set of processors and dividing said processors into processor groups, each processor group coupled to a memory storage device;
• assigning said plurality of files to said processor groups and further to said processors in each processor group in an evenly distributed manner;
• and
• storing said assigned files in said memory storage device of each processor group according to said assignment, and mapping said files assigned to each processor from said memory storage device to a shared memory of each processor;
• receiving data updates with reference to specific files;
• consulting a route table for file assignment to processors;
• and
• updating data stored in said shared memory of said processors assigned to said specific files;
• updating data stored in said memory storage device with data stored in said shared memories of each processor in said respective processor group, wherein said data updating step includes the steps of:
• initializing a synchronization timer;
• copying at least a portion of a file at the expiration of said synchronization timer to said memory storage device;
• and
• resetting said synchronization timer and repeating said copying and timer resetting steps to copy all files.

A method for organizing data storage and access in a database, comprising the steps of:

• organizing data in said database into a plurality of files, each file having a file index and contain a plurality of records;
• providing a first set of processors and dividing said processors into processor groups, each processor group coupled to a memory storage device;
• assigning said plurality of files to said processor groups and further to said processors in each processor group in an evenly distributed manner;
• storing said assigned files in said memory storage device of each processor group according to said assignment, and mapping said files assigned to each processor from said memory storage device to a shared memory of each processor;
• synchronizing the data stored in shared memories of said first and second sets of processors;
• marking each record containing modified data as dirty as the data is being modified, said files having a plurality of records;
• transferring a copy of all dirty record of all the files to a buffer;
• and
• transmitting the buffer to said second set of processors.

A method for organizing data storage and access in a database, comprising the steps of:

• organizing data in said database into a plurality of files, each file having a file index and contain a plurality of records;
• providing a first set of processors and dividing said processors into processor groups, each processor group coupled to a memory storage device;
• assigning said plurality of files to said processor groups and further to said processors in each processor group in an evenly distributed manner;
• and
• storing said assigned files in said memory storage device of each processor group according to said assignment, and mapping said files assigned to each processor from said memory storage device to a shared memory of each processor;
• associating a file index with each file;
• storing information on a wireless service subscriber in a record in one of said files;
• associating a personal subscriber number with said wireless service subscriber;
• and
• performing a modulo operation on said personal subscriber number to compute for said file index thereof.

A method for organizing data storage and access in a database, comprising the steps of:

• organizing data in said database into a plurality of files, each file having a file index and contain a plurality of records;
• providing a first set of processors and dividing said processors into processor groups, each processor group coupled to a memory storage device;
• assigning said plurality of files to said processor groups and further to said processors in each processor group in an evenly distributed manner;
• and
• storing said assigned files in said memory storage device of each processor group according to said assignment, and mapping said files assigned to each processor from said memory storage device to a shared memory of each processor;
• associating each record of a file with a node in a Red-Black Tree data structure;
• and
• searching among nodes of said Red-Black Tree data structure to locate a specific record.