Abstract: In embodiments of the present application, data is stored in a complex file which contains a plurality of regular files in a file system. A regular file is any file in a traditional file system. The term “complex file” refers to a sequence of regular files on disk to represent one logical file in whole. A complex file includes all the application interface (API) of a regular file, such as open, read, write, seek, status, close operations. In addition, a complex file has an insert API for inserting a block of data into the file, and removal API for removing a block of data from the file. A complex file can be encapsulated in a directory or any location in a file system. The files inside a complex file are called internal files.

Abstract: The present disclosure discloses systems and methods for storing data records of a table or any data collection in a database system. The records are stored in a plurality of data files on a computer server. The system considers both the sequential I/O and random I/O options in the processing writing data records to a disk, and finds the best approach to writing data to the disk. Under certain conditions, the method analyzes and recognizes that sequential I/O may perform better. Under another condition, the method analyzes and recognize random I/O may perform better. Under other conditions, the method analyzes and recognizes a combination of sequential I/O and random I/O may perform better. The method chooses the option that has the minimum-cost for storing data records in a disk file. In doing so, the method considers and applies system constraints, such as memory resource and I/O latency.

Abstract: The present disclosure relates to systems and methods that require no data redistribution during a database scaling process. Requiring no data redistribution (also called data migration) can save many hours, or days, or even weeks of overhead during database scaling process. Embodiments of the present disclosure disclose only exchanging control messages among database servers. The control messages may include system configuration information, network topology information, database and table structure information, and any other kind of meta-data information. In the said embodiments, database servers are grouped into clusters. A database server may be a physical computer or a virtual server. Data stored in the existing database servers is not migrated to the new servers. When new database servers are added to the distributed database system, a new cluster is formed to include the new servers.

Abstract: When a new data record enters the system for storage, key router verifies if the key in the data record already exists in one of the data files (file 106, 108, 110, and 112). If the key exists, the new data record is rejected. Otherwise, key router assigns a file number to the record and directs the system to store the record in the data file corresponding to the file number.

Abstract: The present disclosure relates to systems and methods that require no data redistribution during a database scaling process. Requiring no data redistribution (also called data migration) can save many hours, or days, or even weeks of overhead during database scaling process. Embodiments of the present disclosure disclose only exchanging control messages among database servers. The control messages may include system configuration information, network topology information, database and table structure information, and any other kind of meta-data information. In the said embodiments, database servers are grouped into clusters. A database server may be a physical computer or a virtual server. Data stored in the existing database servers is not migrated to the new servers. When new database servers are added to the distributed database system, a new cluster is formed to include the new servers.

Abstract: Provided are computer devices and methods for effectively generating and updating a sorted array for quick data access. The array allocates more space than required by the elements it stores. In other words, the array leaves empty spaces between elements such that insertion of a new element only requires the shifting of a small number, or even none, of the existing elements in the array.

Abstract: Provided are computer devices and methods for effectively generating and updating a sorted array for quick data access. The array allocates more space than required by the elements it stores. In other words, the array leaves empty spaces between elements such that insertion of a new element only requires the shifting of a small number, or even none, of the existing elements in the array.

Abstract: Provided are computer devices and methods for effectively generating and updating a sorted array for quick data access. The array allocates more space than required by the elements it stores. In other words, the array leaves empty spaces between elements such that insertion of a new element only requires the shifting of a small number, or even none, of the existing elements in the array.

Abstract: Provided are computer devices and methods for improved data storage, indexing and search. The methods entail the use of hash tables incorporated into nodes of search trees so as to increase the capacity of the nodes and reduce the size of the tree; hence reducing the time to identify a node while searching in the tree. The hash tables are so structured to maintain the hierarchy of the search tree and speed up the search within the hash table.

Abstract: A method of screening a voice communication from a caller includes registering a subscriber with an agent center to provide the subscriber with a unique identification number, adding the unique identification number to a list of approved callers associated with a subscriber telephone number, and blocking calls to the subscriber telephone number if the caller is not on the list of approved callers and forwarding calls to the subscriber number if the caller is on the list of approved callers.

Abstract: A method of screening a message includes conveying a first electronic message from a unique public address of a receiver to a unique private address of the receiver and delivering the conveyed first electronic message from the private address to a receiver address. The electronic message may be an email and the addresses may be email addresses.