METHOD AND SYSTEM FOR PROCESSING QUERY MESSAGES OVER A NETWORK

• US 20120102016A1
• Filed: 11/09/2011
• Published: 04/26/2012
• Est. Priority Date: 11/01/2001
• Status: Active Grant

• Current Assignee: VeriSign, Inc.
• Original Assignee: VeriSign, Inc.
• Inventors: BALOGH, Aristotle Nicholas
• Granted Patent: US 8,682,856 B2
• Time in Patent Office: Days
• US Class Current: 707/706
• CPC Class Codes: G06F 16/2315 Optimistic concurrency control
• CPC Class Codes: G06F 16/2358 Change logging, detection, and notification replication G06F16/27
• CPC Class Codes: G06F 16/2365 Ensuring data consistency and integrity
• CPC Class Codes: G06F 16/245 Query processing
• CPC Class Codes: G06F 16/2471 Distributed queries
• CPC Class Codes: G06F 2209/5018 Thread allocation
• CPC Class Codes: G06F 9/505 considering the load
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues
• CPC Class Codes: Y10S 707/959 Network
• CPC Class Codes: Y10S 707/966 Distributed
• CPC Class Codes: Y10S 707/99938 Concurrency, e.g. lock management in shared database
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99952 Coherency, e.g. same view to multiple users
• CPC Class Codes: Y10S 707/99953 Recoverability

Abstract

Embodiments of the present invention provide a method and system for processing query messages over a network. Specifically, a plurality of queries may be extracted from a plurality of query messages received from a plurality of users over a network. A number of queries, included in the plurality of queries, may be determined, and a current sequence number may be associated with the plurality of queries. A request message may be created including the plurality of queries, a first sequence number equal to the current sequence number and a first message count equal to the number of queries. The request message may be sent to a search engine and a response message may be received from the search engine. The response message may include a plurality of replies, a second sequence number, a second message count, a third sequence number and a third message count. A plurality of reply messages may be created from the plurality of replies and sent to the plurality of users over the network.

Claims

1-27. -27. (canceled)

28. A computer-implemented method, performed by a computer system comprising one or more processors and computer memory, for modifying information in a database stored in volatile memory, comprising:

receiving a modification request including a search string and modification data;

assigning the modification request to an update thread for processing, the processing comprising;

using a search engine, retrieving a first pointer to a first record corresponding to the search string;

using the first pointer, copying the record into a second record;

modifying the data in the second record based on the modification data;

determining a second pointer for the second record; and

in an uninterruptable process and without locking read access to the database, updating the search engine with the second pointer;

writing the second record to a snapshot file stored in non-volatile memory; and

purging the first record from the database stored in volatile memory, the snapshot file maintaining the first and second record.

29. The method of claim 28, wherein writing occurs after at least two different modification requests update the pointer contained in the search engine.

30. The method of claim 28, wherein writing occurs when the database stored in volatile memory grows to a limit allocated for the database.

31. The method of claim 28, wherein the search engine comprises a hash table.

32. The method of claim 31, wherein the hash table is rebuilt when the purging occurs.

33. The method of claim 28, wherein the snapshot file is loaded from a remote computer across a network.

34. A system for modifying information in a database stored in volatile memory comprising:

a non-transitory memory storing instructions; and

a processor executing the instructions to cause the system to perform a method comprising;

receiving a modification request including a search string and modification data;

assigning the modification request to an update thread for processing, the processing comprising;

using a search engine, retrieving a first pointer to a first record corresponding to the search string;

using the first pointer, copying the record into a second record;

modifying the data in the second record based on the modification data;

determining a second pointer for the second record; and

in an uninterruptable process and without locking read access to the database, updating the search engine with the second pointer;

writing the second record to a snapshot file stored in non-volatile memory; and

purging the first record from the database stored in volatile memory, the snapshot file maintaining the first and second record.

35. The system of claim 34, wherein writing occurs after at least two different modification requests update the pointer contained in the search engine.

36. The system of claim 34, wherein writing occurs when the database stored in volatile memory grows to a limit allocated for the database.

37. The system of claim 34, wherein the search engine comprises a hash table.

38. The system of claim 37, wherein the hash table is rebuilt when the purging occurs.

39. The system of claim 34, wherein the snapshot file is loaded from a remote computer across a network.

40. A non-transitory computer-readable storage medium containing instructions which, when executed on a processor, perform a method comprising:

receiving a modification request including a search string and modification data;

assigning the modification request to an update thread for processing, the processing comprising;

using a search engine, retrieving a first pointer to a first record corresponding to the search string;

using the first pointer, copying the record into a second record;

modifying the data in the second record based on the modification data;

determining a second pointer for the second record; and

in an uninterruptable process and without locking read access to the database, updating the search engine with the second pointer;

writing the second record to a snapshot file stored in non-volatile memory; and

purging the first record from the database stored in volatile memory, the snapshot file maintaining the first and second record.

41. The non-transitory computer-readable storage medium of claim 40, wherein writing occurs after at least two different modification requests update the pointer contained in the search engine.

42. The non-transitory computer-readable storage medium of claim 40, wherein writing occurs when the database stored in volatile memory grows to a limit allocated for the database.

43. The non-transitory computer-readable storage medium of claim 40, wherein the search engine comprises a hash table.

44. The non-transitory computer-readable storage medium of claim 43, wherein the hash table is rebuilt when the purging occurs.

45. The non-transitory computer-readable storage medium of claim 40, wherein the snapshot file is loaded from a remote computer across a network.