CONTINUOUS AVAILABILITY UPDATING OF MULTIPLE MEMORIES

Abstract: A multiple memory system continuously available for queries. Multiple copies of a data set allow that data set to be available for inquiries at all times and specifically at those times when the data set is being updated. At least one copy of the data set is always available in read mode even while another copy might be in the process of being updated. The data set being queried is always either the most current data or very close to being most current. The maximum latency is a function of the amount of information in the most recent update. The implementation of this type of system is especially advantageous for search engines for which queries must be responded to in a very prompt manner. In this type of system it is not acceptable for an inquiry to be delayed while an update is taking place, and it is acceptable for an inquiry to take place on data which is almost completely current if not completely current.

Description: CONTINUOUS AVAILABILITY UPDATING OF MULTIPLE MEMORIES TECHNICAL FIELD The present invention relates to a method and system for making any memory medium continuously available for reading while the memory is being updated with more current information. It specifically relates to making information in a database continuously available to inquiries while updates are being simultaneously processed. BACKGROUND Intranets and the global computer network have required databases that are frequently updated and must handle a high rate of inquiries. In the prior art, while the database is being updated, no inquiry responses can be provided. For certain applications, like for network search engines, the delays for updating have become unacceptable. In these applications, it is more important to respond quickly to every inquiry, even if the response is not the very latest data, than to delay the response to ensure that the data provided is the most current. SUMMARY OF THE INVENTION The present invention employs two (or more) copies of data, which are, in the preferred embodiments, alternatingly updated. A switch controls update and inquiry operations allowing both to take place simultaneously although on different yet very similar copies. The result is continuous availability of the data to inquires. However, there is a latency in the availability of completely updated data for inquiries, since there are possible inquiries ongoing at the same time an update occurs. The nature of the applications utilizing this invention need to be such that absolutely up to date information is not critical. One basic embodiment of the present invention writes each update received to both memories, one after the other, making each memory available for inquiries immediately after being updated. Another embodiment allows the writing of multiple updates to a single memory before switching which is available for queries and which is being updated. This is useful when an inquiry is taking place on the memory not being updated which is long relative to the length of time necessary for writing one update. While waiting for the query to finish, it is efficient to provide to the other memory as many updates as time allows, effectively combining many updates into one update which is then provided to the other memory after the switching. Another embodiment of the present invention makes both memories available for inquiries when there is no pending update. This enhancement allows a query performance improvement through efficient use of all resources. Another embodiment incorporates additional memories, all of which are available for inquiries when there is no pending update. This enhancement allows performance improvement through scalability. Another embodiment allows for a delay by more than the time necessary for processing the current update before that update is applied to other memories. This allows for updates to be made only when the amount of information to be updated reaches some threshold. All embodiments allow for both inquiries and updates to occur simultaneously although on different copies of memory. This allows for a major performance increase for inquiries, particularly for search engines. The present invention allows for memories ranging in size from multiple bits and bytes to full-fledged databases and files and servers. This allows for tremendous scalability and performance ranges. An important embodiment is where each memory is some part of a larger memory and where the entire larger memory is available for inquiries at all times. For example if a table is distributed over several servers by rows, then all rows would be available for inquiries at all times. All memories are continuously available although not necessarily completely current. Another embodiment allows for the memories to be segments of a segmented index which is then distributed over a number of servers for purposes of performance and scalability. All segments of the segmented index are then continuously available for inquiries directed across a number of servers and, because of the duality or plurality of each segment, each is also continuously available for updates. The result is a distributed index which is available for both inquiries and updates at all times. Another embodiment includes a client notification feature wherein search applications are notified as to which copy or copies of a given segment are available for inquiries and where the inquiries are then directed to the segments available. A further embodiment includes a further enhancement of the client notification feature wherein not only search applications, but the entire system including the update applications are notified as to which copy or copies of a given segment are available for inquiries or updates and where applications then direct relevant requests to available segments. In a further embodiment, the segmented index is made up of records, each of which consists of a type and a value specifically stored as a pair as part of a reference. Types are things like a character, a word or a concept and values are things related to the types. For example the type of word might have as a value any specific word. The type of color might be red or green or blue or any other specific color. The pair is associated with a reference to a logical location such as a web page. This turns out to be extremely useful for Internet style searches. In another embodiment, schema information is implied by the type-value pairs and so is not explicitly present at each segment. This allows an index of the type-value pairs to be divided into segments which have no requirement for explicitly shared information of any kind. The result is improved performance since it is not necessary to process schema information as part of an inquiry and the processes operating on each segment can operate without coordination between each other. A further embodiment uses a notification service to inform a query processor which segments of a segmented index are relevant to a query. For example if a query is for a word which begins with an 's' and the system knows that all records with type word where the words begin with 's' are on servers '20' and '21', this information is shared with the inquiry application. Inquiries can then be directed to the relevant servers and to the relevant copies of segments on those servers. The result is an efficient use of all resources. A preferred embodiment combines several of these embodiments and is an index segmented by share-nothing type-value pairs that is distributed across multiple servers making the entire index continuously available to a web search engine and at the same time continuously available for system updates. There are notification services available which allow inquiries to be directed only to relevant copies of segments. The overall result is an efficient and scalable high performance system. A distinct embodiment of the present invention allows for systems with data updates which come in units of some size which are not broken down into smaller parts. Each update is a complete unit that entirely replaces a prior unit like in flash memory systems. If there are two logical memories for each unit, such as where each unit is a record and the memories are two portions of one or two hard disks for each record, each update needs to be written only once to one of the memories and the updates can be alternated between the memories. Although each memory misses every other update, the queries always receive the latest update that has been written because they alternate as well. Although this version will generally require that each update include more data than minimally necessary, it cuts in half the amount of writing to a memory that is required for each update. This is useful and economical when update speed is important and the time required to write complete units is small relative to other system parameters. Each of the embodiments noted above can be applied to this type of system where data comes in units, there is a pair of logical memories for each unit (which may or may not be physically separated), and each update completely replaces a prior unit. The invention can be implemented in hardware or a combination of hardware and software. Hardware implementations are especially relevant where speed is important and where the memories are relatively small. BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a simple system diagram of the present invention showing continuous availability updating of multiple memories. Figure 2 is a hardware diagram of the present invention showing continuous availability updating of multiple memories. Figure 3 is a simple server with backup (prior art). Figure 4 is a diagram of a RAID system (prior art). Figure 5 shows a mirrored server system (prior art). Figure 6 is block diagram showing the architecture of a search engine for actively indexing the World Wide Web according to one embodiment of the invention and showing the index servers and the update-processing server of the present invention. Figure 7 is functional block diagram of the central server of Figure 6 again showing the index servers and the update-processing server of the present invention. Figure 8 is a bubble chart illustrating the process executed by the update process server of Figure 7. Figure 9 is a bubble chart illustrating the overall data flow in the search engine of Figure 7. Figure 10 illustrates components of the indexing system of Figure 6 for a Java- based implementation of the indexing system according to one embodiment of the present invention. Figure 11 is a functional data flow diagram illustrating an alternative embodiment of the central cataloging site of Figure 6. DETAILED DESCRIPTION OF THE INVENTION Figure 1 is a logical diagram of a simple way to embody the present invention for any type or amount of data. Figure 2 is a block diagram showing the same type of system at a hardware level. This type of system will work for bits, bytes, records, fields, records, tables, disks or databases. The data can be atomic or can be segmented or distributed. The key concept is a switching capability operating on multiple copies of data that are identical or are sequential updates for each other, making the complete data available simultaneously to an update application that can be as simple as a bit- write or as complex as a complete database update and to one or multiple inquiries which can be as simple as a bit-read or a complex as multiple inquiries of a distributed, segmented database. Performance improvement and scalability are the goals achieved by implementing this invention. Performance is improved by having the data available at all times so there is never a wait for the completion of an update operation. Scalability is attained simply by increasing the number of copies of the data available for inquiries. A diagram of the elements of a system that allows continuous availability of data while updates occur is shown in Figure 1. The data stored in each memory is essentially the same for each data set 10, although either set may be out of date by the latest update 11. The trade off for not having the most current data at all times is that a current or almost current data set is available at all times to inquiries 12. Upon completion of an update 11 an inquiry switch 13 always makes a data set 10 available for inquiries 12. At the same time, an update switch 14 may or may not, depending upon the embodiment, make the other data set 10 available for writing. In the preferred embodiment, to minimize the size of each update, the updates are not complete replacements of the data and each update is written to all memories. In this case, it is possible to have a plurality of memories and to allow all memories not being currently updated to be in read mode with identical data. In one alternative embodiment, the data to be written is in units which completely replace the prior data. This is useful when the memory medium is relatively inexpensive or when the data units are relatively small. Each update completely replaces all data in the unit and each unit has two associated dedicated blocks of memory. Once one of the memories has been updated, it is made available for reading. Then, instead of copying the same update to the first memory, it is updated with the next update of the entire unit and then made available for reading. By this process, each update is written only once to one memory rather than twice. Each memory receives every other update. In both of these embodiments, the data set can be as small as a single bit or as large as a complete disk array or anywhere in between. The hardware necessary for continuous availability of data is shown in Figure 2. There are dual memories 21 and 22, each connected to the data controller 20 by input/output channels 23. A processor 26 accepts update 25 and inquiry 26 requests and instructs the controller 20 to direct the requests to the proper memory 21 or 22. At least one memory is always available for inquiries 27. The other memory may be either write or read enabled, depending upon the embodiment. In addition there must be an update application (25) and an inquiry application (26), both typically implemented in software and executed on any available processor. In one embodiment, there are two basic hardware states defined. In the first state, the controller (20) switches the channel (23) coupled to one memory (21) to read mode and at the same time switches the other channel (23) coupled to the second memory (22) to write mode. The second state is the opposite. The controller (20) switches the channel (23) coupled to the first memory (21) to write mode and at the same time switches the other channel (23) coupled to the second memory (22) to read mode. The system goes through the two states, one after the other, over and over again as long as it is in operation. The processor (26) always directs inquiries to the channel in read mode and updates to the channel in write mode. One memory is continuously available for queries. Comparison to the Prior Art The are many examples of prior art where two or more memories have been configured to store identical or nearly identical copies of data, but none of these configurations make the data continuously available for reading while the data is being updated. A server with a backup capability is the simplest (Figure 3). Multiple inquiries 33 are made to a single server 30, which is taken off-line from time to time to perform a backup 32, and also to perform updates 31. There is no continuous availability. Another method is based on an array of disks. RAID systems (Figure 4) split up the data for performance and keep a backup on another drive. The method for splitting the data into portions for each drive is typically to allocate a certain number of records to each. Consequently, when the database is updated 41, certain records might need to be moved from one disk 40 to another. Inquiries 42 and read operations, at least for the affected records, must take this process into account. There is no continuous availability on RAID systems. There is a way to provide multiple identical copies of databases or parts of databases. Mirrored systems (Figure 5) provide live backup and improved performance. This is a logically simultaneous operation where data is not available for reading from the disk until it has been written to both drives or servers 50. Because the data on each disk must be synchronized so that all disks provide the same response to each inquiry 52, the disks must all be taken off-line when they are updated 51. A Preferred Embodiment for a Network Index A preferred embodiment of a continuously available data set is an index for a network search engine. Figure 6 is a block diagram of an indexing system according to one embodiment of the present invention. The system includes a central server that stores a central index. Each of the components in the central server will now be described generally, with respective components being described individually in more detail below. The central server includes a router 210 that directs packets comprising search requests and update transactions through a load-balancing switch 212 to an appropriate set of servers 214, 302 and 222. The switch 212 balances traffic to all web servers 214 to prevent overloading respective web servers and improve overall performance of the central server. The router 210 also functions to allow offline updates of index server sets 216 and as a dispatch point to prevent searches from being applied to an index server currently receiving updates, as will be explained in more detail below. The web servers 214 generate the parallel queries necessary to perform a search using the index servers 216. In one embodiment of the central server, there are twenty web servers 214. The central server further includes a master index server 218 containing a master copy of the entire central search index or catalog. In the embodiment of Figure 6, the master index server 218 has a redundant array of independent disks or RAID to provide protection against disk failures and loss of the central search index. In addition, the central index stored on the master index server 218 is also stored on a remote master index server 220 at a different physical location to provide backup of the central search index. A number of update servers 222 each receive updates. Each of the update servers 222 applies all index change transactions through a firewall/router 224 to the master index server 218, which, in turn, updates the central search index and then distributes those changes to the various index server sets 216. The master index server 218 also sends instructions to the Name Space / Directory Server 233 to dynamically determine which set of index servers 216 is to remain on-line to service search requests, and which set is to receive the updates. Agent programs 204 on remote computers transmit transaction lists to the central server, and each transaction list is stored on one of the update servers 222. Each transaction list is referred to as a batch, and each batch contains a series of deletion and addition transactions formatted as commands. More specifically, each batch represents an incremental change record. The update server 222 thereafter transfers each batch to the master index server 218, which, in turn, updates the master index to reflect the index changes in the batch. It should be noted that the agent 204 transmits only "incremental" changes to the central server. The overall operation of the central server will now be described in more detail with reference to the functional block diagram of Figure 7. In Figure 7, many components previously discussed with reference to Figure 6 are shown, and for the sake of brevity the detailed operation of each such component will not again be described in detail. The central server performs index update processing to update the central index stored on the master storage server 218 and the segmented central index stored on the index servers 216, 217, as will now be described in more detail. The queue manager receives update transaction batches from the update server 222. The queue manager 302 stores the received update transaction batches, and periodically transmits a copy of the stored transaction batches to a remote queue manager 304 for processing. The queue manager 302 also periodically transmits a copy of the stored transaction batches to an update-processing server 306. The queue manager 302 stores update transaction batches received during a predetermined interval, and, upon expiration of this interval, the update batches are transferred to the update-processing manager. Upon receiving the update transaction batches, the update-processing server 306 applies all the batches to update the central index stored on the master storage server 218. Once the central index stored on the master storage server 218 has been updated, the master storage server 218 applies the update transaction batches through the router to update the segmented central index stored on the index server sets 216, 217. During updating of the segmented central index stored on the index server sets 216, 217, the update transaction batches are directed to only one set of index servers 216, 217 while the other set remains online to handle search queries, and thereafter places the updated set of index servers 216, 217 online and updates the set previously online. The result is continuous availability of the entire index. For example, assume the index servers 216 are the primary set of index servers and the servers 217 are the secondary set. Each index server set 216, 217 can contain all or a portion of the central index 218. As seen from the above example, the primary and secondary index server sets 216 and 217 eliminate the need for record locking of the segmented central index to which search queries are applied. Thus, all the records of the segmented central index are always available for search queries. Moreover, if one server of the primary index server set 216 or 217 fails, the remaining servers of that set will continue to serve queries. If the entire server set fails, the corresponding secondary index server set is made the primary so that the entire segmented central index is available for applied search queries. It should be noted that in the unlikely event that both the primary and secondary index server sets 216, 217 for a particular segment of the central index simultaneously fail, the remaining segments of the central index remain available for applied search queries, and only the segment of the central index stored on the failed index servers becomes unavailable. In other words, search queries are still applied to the vast majority of the central index so that reasonable search results may are still obtained. In a case where both server sets fail, queries for the segment that had failed could be sent to the central index. The index server sets are used to provide query results for searches submitted by the Web Servers. Each set of servers is identical, and each set of servers contains a portion of the overall index. Initially, the division will be alphabetical and numerical, for a set of 36 servers. Server "A" would contain the index for all words beginning with "A". Only one set of servers is updated at a given time, while the other set remains on-line to service search requests. This permits the system to be run without file-locking constraints and allows for local failure should one server become inoperative. Figure 8 is a bubble chart showing the process executed by the update- processing server 306. The process begins in step 700 with the update processing server 306 retrieving queue entries 700 from the queue manager 304. In the embodiment of Figure 8, the queue entries 702 are retrieved periodically so that in step 700 the queue entries for the last N hours are retrieved. From step 700, the process proceeds to step 704 and the update processing server 306 applies the queue entries to the master index server 218 which, in turn, utilizes the queue entries in updating the master index, as previously described. Once the queue entries 702 have been applied to the server 218, the process proceeds to step 706 and the update-processing server 306 applies a deletion request 708 to the queue manager 302. In response to the deletion request 708, the queue manager 302 deletes the update entries stored in the queue database 606 that have now been applied to the master index server 218. The central index on the master index server 218 has now been updated to include entries in the queue database 606, so these entries are deleted since they are now reflected in the central index and thus no longer needed. Figure 9 is a bubble chart illustrating the overall data flow between the search engine, agent, and components of the active indexing system. Each aspect of the overall data flow has already been described in a corresponding section above, and thus Figure 9 will now be described merely to provide a brief description of the overall data flow of the indexing system according to one embodiment of the present invention. The components of the process in Figure 9 may logically broken into two functional groups, an indexing group and a searching group. In the searching group, a user 800 applies a search request (inquiry) to one of the web servers 214, which processes the search request and applies it to selected ones of the index servers 216, 217 (continuously available segments). In response to the applied search request, each of the search index servers 216, 217 queries its corresponding local index segment 802 and generates search data. The index servers 216, 217 then return the search results to the web server 214, which, in turn, provides the user 800 with the search results corresponding to his applied search request. The remaining components in the Figure 9 are in the indexing group (updates). The queue manager 302 receives updates from each of the agents 204. The queue manager makes update and deletions to the queue database 602 corresponding to the received updates, and also provides a mirror copy of these updates to the remote queue manager 304. The update-processing server 306 retrieves the update entries from the queue manager 302, and applies the updates to the master index servers 218. The server 218 updates the master index to include the applied updates, and the update-processing server 306 then sends a deletion request to the queue manager 302 to delete the corresponding entries from the queue database 602. Once the master index server 218 has updated the master index, the server updates the segmented index stored on the search index servers 216, 217 as previously described. Each of the search index servers 216, 217 updates its corresponding portion of the segmented index in response to the updates from the master index server 218. As previously mentioned, the entire segmented index stored on the index servers 216 is continuously available for processing search requests even during updating of the segmented index. The entire segmented index is available due to the redundant architecture of the servers 216, 217, as previously described. The indexing system may be used not only on the global communications network but on corporate Intranets as well. A typical corporate intranet includes a central location, such as a corporate headquarters, at which a central searchable database is maintained, and a number of remote locations, such as regional offices or stores, coupled to the central location through a network of intranet. Each remote location transfers data to the central location for storage in the central database. The remote locations may also search the central database for desired information. A Java-based implementation of the software elements of the indexing system is now described according to one embodiment of the present invention. We look at several elements from a simple requirements analysis through use cases to package details in class diagrams. The server architecture of the system provides a number of services which support the management and use of index information. The system is divided into several components, which can be run on different machines as needed in a truly distributed architecture. The design must scale well and be self-healing wherever possible. To make this possible, Jini technology plays an important role in the architecture and services are exposed using that infrastructure. As components are brought online, they advertise their existence to the local Jini lookup service. This information is automatically propagated to services that need access to other services and handshaking brings elements into the Jini community as they are announced. If non-critical parts of the system become unavailable, the system is able to compensate by distributing load to other machines hosting the necessary services. As shown in Figure 10, a load balancer 2001 allows round-robin distribution of incoming traffic to web servers 214 and the agent listener 2003. The web servers 214 provide user services like account registration, agent downloads, and search capabilities. The AgentListener 2003 is a secure socket listener that manages agent connections. Users can make queries on the search index. The QueryDispatchService 2014, which delegates sub queries to appropriate IndexSegmentServices, handles these. Incoming information from agents is added to the MessageQueueService 2009 and popped off by the UpdateManagerService 2008. Agent-collected changes are added and/or removed in the MasterlndexService 2011. Figure 10 shows request/response flow with the direction of arrows. The intent is to make clear who is asking for the execution of respective services. The web server 214, serving up static and dynamic content through Servlets and Java Server Pages, can communicate with the UserAccessService 2005 and the QueryDispatchService 2014, but nothing else. The AgentListener 2003 can talk to the UpdateManagerService 2008 and the MessageQueueService 2009 only. An IndexSegmentService 2013 is able to initialize itself by asking for information from the MasterlndexService 2011. Finally, the UpdateManagerService 2008 can talk to the MessageQueueService 2009 and the MasterlndexService 2011. Its job is to keep the MasterlndexService up to date by processing incoming agent messages. Because we are using Jini, the order in which services are brought up can determine which other services can operate, but does not restrict that order in any way. If an UpdateManagerService is unavailable, for example, the system will not process updates from the message queue, but processing will resume as soon as the UpdateManagerService is brought up again. As long as more than one instance of a given service is available, the system can discover those services automatically, as they are brought online. An IndexSegmentService 2013 is associated with a given IndexSegmentRange, which determines the prefix character range for the index content. When an IndexSegmentService 2013 is brought online, it automatically becomes available to the QueryDispatchService 2014. If one of these services is reinitialized periodically, the update will be completely transparent, and the data will be continuously available, so long as other IndexSegmentService objects cover the same IndexSegmentRange. This might be a single server or may be distributed arbitrarily across a number of IndexSegmentService instances. So long as a QueryDispatchService instance is available to the web servers, and sufficient IndexSegmentService instances are available to cover the full range of possible tokens, the system is capable of executing queries. The indexing system with continuous availability is further described in US Patent application 09/419,405 which is incorporated herein. Figure 11 is a functional data flow diagram illustrating an alternative embodiment of the central cataloging site of Figure 6. In Figure 16, a web server 4700 is the main gateway for all search requests. An update batch processor 4702 receives, stores, and applies update batches created by remote agents 204, and also transmits copies of the batches to redundant remote catalog sites. A remote update batch processor 4704 receives and applies batches received from a master catalog site to a local index server for the purposes of redundancy. An index server 4706 stores all search index information in a series of database segments, and creates result sets from queries applied to it as a result of search requests received by the web server 4700. The system of Figure 16 includes an update batch storage area 4710 which contains the received update batches transmitted by agent programs 204 on remote hosts, and these batches are deleted after processing. An index segment storage area 4712 contains a subset of the total index database for the index server 4706. For example, a single segment might contain the keyword fields for all of the keywords beginning with the letter "A". Typically, these storage areas will be placed on high-speed RAID storage systems. An index segment storage twin area 4714 is identical to the storage area 4712. The purpose of the twin area 4714 is to provide access to existing index information while the corresponding index segment storage area is being updated. This permits updates to be applied to a segment without requiring record locking. The index server 4706 is simply notified as to which segment areas are available for search processing. Once updated, the area 4712 or 4714 becomes available again. An index signature storage area 4716 that stores the current digital signature of the index for a particular site serviced by an agent 204 on a remote host. The update processor 4702 periodically updates the index segments on the index server 4706. All updates received are applied as batches to retain data integrity on the index server 4706. The update processor 4702 separates update information as required to match the segments on the index server 4706, then updates each segment storage area 4712 and each segment storage twin area 4714. While a segment storage area 4712, 4714 is being updated, its counterpart is available for search request processing. The result is continuous availability. Once all updates have been applied, the digital signature of the index for the site is updated in the index signature storage area 4716 and the batch is deleted from the update batch storage area 4710. In processing search requests, the web servers 4700 receive and interpret the search requests from remote portals or web browsers. Each search request is preprocessed to divide the request into sub-requests as required for each index segment, then the index server 4706 is requested to perform search queries on each relevant segment. More than one index segment may be queried simultaneously. The index server 4706 determines which index segment storage areas 4712, 4714 are available for use, applies the search request, and transmits the results to the web server 4700 which, in turn, collects and collates all search results and transmits these results back to the requesting system in a formatted manner. It is to be understood that even though various embodiments and advantages of the present invention have been set forth in the foregoing description, the above disclosure is illustrative only, and changes may be made in detail, and yet remain within the broad principles of the invention. Therefore, the present invention is to be limited only by the appended claims.

Claims: CLAIMS 1. A method for providing continuous availability to one or more bits of stored data while said data is being updated, comprising: (a) having data in a first memory and the same data in a second memory; (b) making said first memory available for reading, (c) receiving an update to part or all of said data, making said second memory available for writing, and writing said update to said second memory; (d) making said second memory available for reading and at the same time making said first memory available for writing; (e) writing said update to said first memory; and (f) making said first memory available for reading. 2. The method of claim 1 where (c) includes receiving and writing to said second memory a plurality of updates and (e) includes writing said plurality of updates to said first memory. 3. The method of claim 1 where both of said memories are made available for reading when there is no update to write. 5. The method of claim 1 where said update is also written to one or more additional memories and said additional memories are also made available for reading. 6. The method of claim 1 where writing said update to said first memory is delayed by more than the time required for consecutive processing. 7. The method of claim 1 where said memories are read in response to a query of said memories and where said memories are updated and queried simultaneously. 8. The method of claim 1 where said one or more bits of data comprise formatted data of a type selected from the group consisting of a byte, a set of bytes, a field of a table, a data record of a database, an index of a database, and a file in a file system. 9. The method of claim 8 where said formatted data is part of a larger set of formatted data of which other parts are stored in other memories and all parts of said larger set of formatted data are available for reading at all times. 10. The method of claim 1 where said one or more bits of data comprise a segment of a segmented index. 11. The method of claim 10 where other segments of said segmented index are stored in other memories and all segments of said segmented index are available for reading at all times. 12. The method of claim 1 where a client application is notified as to which memory is available for reading and queries are directed by said client application to the available memory. 13. The method of claim 1 where notice is given to a system as to which of said memories is available for reading by clients. 14. The method of claim 10 where said index is comprised of records, each of which is comprised of a type and a value specifically stored as a type-value pair as part of a reference. 15. The method of claim 14 where no explicit schema information is associated with said type-value pairs or shared between said segments of said segmented index. 16. The method of claim 10 where a notification service is used to inform a query processor as to which segments of said segmented index are relevant to a query. 17. The method of claim 16 where queries are applied only to segments containing potentially relevant data. 18. A method for providing continuous availability to a unit of one or more bits of stored data while said unit of data is being updated, where each update is a complete unit that entirely replaces a prior unit, comprising: (a) having a unit of data in a first memory and making said first memory available for reading; (b) receiving an update to said unit of data and writing said update to a second memory; (c) making said second memory available for reading and at the same time making said first memory not available for reading; (d) receiving a second update to said unit of data and writing said second update to said first memory; and (e) making said first memory available for reading and at the same time making said second memory not available for reading. 19. The method of claim 18 where (b) includes receiving and writing to said second memory a plurality of updates. 20. The method of claim 18 where (d) includes receiving and writing to said first memory a plurality of updates. 21. The method of claim 18 where both of said memories are made available for reading when there is no update to write. 22. The method of claim 18 where said update is also written to one or more additional memories and said additional memories are also made available for reading. 23. The method of claim 18 where writing said second update to said first memory is delayed by more than the time required for consecutive processing. 24. The method of claim 18 where said memories are read in response to a query of said memories and where said memories are updated and queried simultaneously. 25. The method of claim 18 where said one or more bits of data comprise formatted data of a type selected from the group consisting of a byte, a set of bytes, a field of a table, a data record of a database, an index of a database, and a file in a file system or server. 26. The method of claim 25 where said formatted data is part of a larger set of formatted data of which other parts are stored in other memories and all parts of said larger set of formatted data are available for reading at all times. 27. The method of claim 18 where said one or more bits of data comprise a segment of a segmented index. 28. The method of claim 27 where other segments of said segmented index are stored in other memories and all segments of said segmented index are available for reading at all times. 29. The method of claim 18 where a client application is notified as to which memory is available for reading and queries are directed by said client application to the available memory. 30. The method of claim 18 where notice is given to a system as to which of said memories is available for reading by clients. 31. The method of claim 27 where said index is comprised of records, each of which are comprised of a type and a value specifically stored as a type- value pair as part of a reference. 32. The method of claim 31 where no explicit schema information is associated with said type- value pairs or shared between said segments of said segmented index. 33. The method of claim 27 where a notification service is used to inform a query processor as to which segments of said segmented index are relevant to a query. 34. The method of claim 27 where queries are applied only to segments containing potentially relevant data. 35. A data storage system that makes data continuously available for read operations during write operations, comprising: (a) a data controller; and (b) a first input/output channel coupled to a first memory; and (c) a second input/output channel coupled to a second memory; (d) where each of said memories is connected to said data controller via said memory's coupled channel; and (e) where said data controller can switch said channels to either of the following states but not both simultaneously: (1) said first channel is coupled to said first memory in write mode and said second channel is coupled to said second memory in read mode, or (2) said first channel is coupled to said first memory in read mode and said second channel is coupled to said second memory in write mode; and (f) where, once said controller has directed data to one of said memories for a write operation, it then switches states and is prepared to direct data to the other memory for a write operation. 36. The system of claim 35 where, when said controller directs data to one of said memories for a write operation, it directs a plurality of updates to said memory. 37. The system of claim 35 where there is a third possible state: (a) where said first channel is coupled to said first memory in read mode and said second channel is coupled to said second memory also in read mode; and where, (b) when said controller has no data to direct to a memory for a write operation, it switches to said third state so that both of said channels are in read mode. 38. The system of claim 35 where, upon switching states, the same data that was directed to one of said memories is directed to the other memory. 39. The system of claim 35 further comprising one or more additional memories each coupled to an additional input/output channel and connected to said data controller via its additional input/output channel and there is a third possible state: (a) where said first channel is coupled to said first memory in read mode and said second channel is coupled to said second memory also in read mode and one of said additional input/output channels is coupled to its memory in write mode. 40. The system of claim 35 where once said controller has directed data to one of said memories for a write operation, said controller switches channels after a delay which is more than the time required for consecutive processing. 41. The system of claim 35 where one or more processors direct updates and queries to said memories simultaneously. 42. The system of claim 35 where said memories store data in a format of type selected from the group consisting of a bit, a byte, a set of bytes, a field of a table, a data record of a database, an index of a database, and a file in a file system. 43. The system of claim 42 where said formatted data is part of a larger set of formatted data of which other parts are stored in other memories and all parts of said larger set of formatted data are available for reading at all times. 44. The system of claim 35 where said memories store data comprising a segment of a segmented index. 45. The system of claim 44 where other segments of said segmented index are stored in other memories and all said segments of said segmented index are available for reading at all times. 46. The system of claim 35 where a client application is notified as to which said memory is available for reading and queries are directed by said client application to said available memory. 47. The system of claim 35 where notice is given to a system including a server containing the memories and clients as to which of said memories is available for reading by clients. 48. The system of claim 44 where said index is comprised of records, each of which are comprised of a type and a value specifically stored as a type-value pair as part of a reference. 49. The system of claim 48 where no explicit schema information is associated with said type-value pairs or shared between said segments of said segmented index. 50. The system of claim 35 where a notification service is used to inform a query processor as to which segments of said segmented index are relevant to a query. 51. The system of claim 50 where queries are applied only to segments containing potentially relevant data. 52. A data storage system that makes complete units of data continuously available for read operations during write operations, comprising: (a) a data controller; and (b) a first input/output channel coupled to a first memory; and (c) a second input/output channel coupled to a second memory; (d) where each of said memories is connected to said data controller via said memory's coupled channel; and (e) where said data controller can switch said channels to either of the following states but not both simultaneously: (1) said first channel is coupled to said first memory in write mode and the second channel is coupled to said second memory in read mode; (2) said first channel is coupled to said first memory in read mode and said second channel is coupled to said second memory in write mode; (f) where, once said controller has directed a unit of data to one of said memories for a write operation, it then switches states and is prepared to direct data to the other memory for a write operation. 53. The system of claim 52 where said unit of data includes a plurality of updates. 54. The system of claim 52 where there is a third possible state: (a) where said first channel is coupled to said first memory in read mode and said second channel is coupled to said second memory also in read mode; and where, (b) when said controller has no unit of data to direct to a memory for a write operation, it switches to said third state so that both of said channels are in read mode. 55. The system of claim 52 where, upon switching states, the same data that was directed to one of said memories is directed to the other memory. 56. The system of claim 52 further comprising one or more additional memories each coupled to an additional input/output channel and connected to said data controller via its additional input/output channel and there is a third possible state: (a) where said first channel is coupled to said first memory in read mode and said second channel is coupled to said second memory also in read mode and one of said additional input/output channels is coupled to its memory in write mode. 57. The system of claim 52 where once said controller has directed a unit of data to one of said memories for a write operation, said controller switches channels after a delay which is more than the time required for consecutive processing. 58. The system of claim 52 where one or more processors direct updates and queries to said memories simultaneously. 59. The system of claim 57 where said memories store data in a format of a type selected from the group consisting of a bit, a byte, a set of bytes, a field of a table, a data record of a database, an index of a database, and a file in a file system. 60. The system of claim 59 where said formatted data is part of a larger set of formatted data of which other parts are stored in other memories and all parts of said larger set of formatted data are available for reading at all times. 61. The system of claim 52 where said memories store data comprising a segment of a segmented index. 62. The system of claim 61 where other segments of said segmented index are stored in other memories and all said segments of said segmented index are available for reading at all times. 63. The system of claim 52 where a client application is notified as to which said memory is available for reading and queries are directed by said client application to said available memory. 64. The system of claim 52 where notice is given to a system including a server containing the memories and clients as to which of said memories is available for reading by clients. 65. The system of claim 61 where said index is comprised of records, each of which are comprised of a type and a value specifically stored as a type-value pair as part of a reference. 66. The system of claim 65 where no explicit schema information is associated with said type- value pairs or shared between said segments of said segmented index. 67. The system of claim 63 where a notification service is used to inform a query processor as to which segments of said segmented index are relevant to a query. 68. The system of claim 17 where queries are applied only to segments containing potentially relevant data.

Inventors: MEADWAY MICHAEL D, TRIPP GARY W, MEADWAY, MICHAEL, D., TRIPP, GARY, W.
Applicants: 360 POWERED CORP, 360 POWERED CORPORATION
Application year: 2000
Main classification: G06F17
IPC codes: G06F17