+

WO2007068279A1 - Procédé et système informatique pour mettre à jour une base de données d’un serveur à au moins un client - Google Patents

Procédé et système informatique pour mettre à jour une base de données d’un serveur à au moins un client Download PDF

Info

Publication number
WO2007068279A1
WO2007068279A1 PCT/EP2005/014210 EP2005014210W WO2007068279A1 WO 2007068279 A1 WO2007068279 A1 WO 2007068279A1 EP 2005014210 W EP2005014210 W EP 2005014210W WO 2007068279 A1 WO2007068279 A1 WO 2007068279A1
Authority
WO
WIPO (PCT)
Prior art keywords
database
data
information
client
modified
Prior art date
Application number
PCT/EP2005/014210
Other languages
English (en)
Original Assignee
Piaton, Alain, Nicolas
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Piaton, Alain, Nicolas filed Critical Piaton, Alain, Nicolas
Priority to PCT/EP2005/014210 priority Critical patent/WO2007068279A1/fr
Publication of WO2007068279A1 publication Critical patent/WO2007068279A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G06F16/275—Synchronous replication

Definitions

  • the invention relates to the field of databases, and more specifically to a method for updating a database from a server to at least one client.
  • a database is usually defined as a collection of data or information organized for rapid search and retrieval, especially by a computer. Databases are structured to facilitate storage, retrieval, modification, and deletion of data in conjunction with various data-processing operations.
  • a database consists of a file or set of files that can be broken down into records, each of which consists of one or more fields. Fields are the basic units of data storage. Users retrieve database information primarily through queries. Using for example keywords and sorting commands, users can rapidly search, rearrange, group, and select the field in many records to retrieve or create reports on particular aggregates of data according to the rules of the database management system being used.
  • the computer program used to manage and query a database is known as a database management system (DBMS).
  • DBMS database management system
  • PDM solution may further be used to automatically store and manage product information.
  • Databases used in PDM systems enable queries to be made on various types of relation between objects stored on the database.
  • search engine a number of search engine are known.
  • a search engine is a program designed to help find information stored on a computer system such as the WWW, a database, or a personal computer.
  • a search engine allows one to ask for content meeting specific criteria such as given in a word or phrase and is adapted to retrieve a list of references matching said criteria.
  • Search engines use regularly updated indexes to operate quickly and efficiently. Typically, a search engine works by sending out a spider to fetch as many documents as possible to extract information. Another program, called an indexer, then reads these documents and creates an index based on the words contained in each document. Search engines use proprietary algorithms to create indices such that, ideally, only meaningful results are returned for each query. A search engine may else work by synchronizing to a database. Metadata can further be used.
  • search engines have been developed for retrieving information, notably on the Internet.
  • Alta Vista Company proposed an Internet search site, with a request box where the user may input keywords for retrieving information.
  • Google Inc. proposed a searching tool for searching html files or text documents (in the PDF, Microsoft Word or RTF formats) available through the Internet.
  • the results are returned to the user as a list of web pages.
  • Each result is displayed as a URL, together with an abstract of the document accessible through the URL.
  • the abstract is an extract of sentences or part of sentences of the document. If a web page is comprised of frames, the result returned to the user may be the URL of the frame, together with an abstract of the frame.
  • Each frame is therefore searched and handled individually by the engine.
  • a web search engine such as Google and MSN search
  • database replication is a concept closely related to transactions. It is even sometimes possible to duplicate data in real time, for example when using a database that can log its individual actions. The duplicate can be used to improve the performance or availability of the whole database system.
  • Known replication concepts include:
  • Server/Client replication wherein all Write requests are performed on the master and then replicated to the slaves; - Quorum: the result of Read and Write requests is calculated by querying a majority of replicas; and
  • Multimaster two or more replicas synchronize each other via a transaction identifier.
  • the replication or update process comprises a number of manually intensive steps.
  • replicates copies of a master database need be frequently updated at many different client terminals.
  • the require update rate may further overload the network capacity.
  • it may take a long time to answer a query on a large replicate database, which is particularly unsuitable when applications involving recurrent queries run at the client terminals.
  • the invention proposes a method for updating a database from a server to at least one client comprising:
  • the database modified at the insertion step is a concatenated table comprising information data and preferably display data.
  • the method according to the invention may comprise one or more of the following features: - during said insertion step, the update data are inserted at the end of the client database; said integrity data are a checksum; if database integrity is confirmed, saving the modified database; the method comprises a step in which, if integrity of the modified database is not confirmed, sending a request from the client to the server requesting the update data for the database to be re-sent; the client is adapted to communicate with said server via two separate communication networks, said update data being received via one of said networks, the request for re-sending employing the other of said networks; the database modified at the insertion step is a concatenated table comprising at least partially encrypted information data and display data, stored on a non- volatile memory, the method further comprising: o accessing the modified database ; o reading a portion of the modified database; and o sequentially scanning said read portion of the database; at the step of reading, said read portion amounts to the whole modified database;
  • the step of reading said portion further comprises decrypting on-the- fly said read portion, all decrypted data resulting from the decrypting step residing on a volatile memory only, and the step of sequentially scanning comprises sequentially scanning the decrypted data only; the read portion is sequentially scanned in an encrypted state; the method further comprises, after the step of sequentially scanning, a step of deleting the read portion; the method further comprises, before decrypting, verification of the authorization of decryption; the verification step uses a decryption key or a hardware device; the method further comprises a step of querying the database modified at the insertion step and retrieving data from that database. querying said modified database comprises sequentially scanning said database or a read portion thereof.
  • the method further comprises a step in which the client displays data retrieved at the retrieving step;
  • said concatenation table comprises information in the form of elementary records, and tags structuring said information, wherein said display step is dependent on said tags - said query step in said modified database comprises sequentially scanning said database or a read portion thereof without taking account of said tags;
  • said concatenated table comprises: o information in the form of elementary records in which: ⁇ a first record contains a word,
  • ⁇ a second record comprises phonetic interpretation data in a first language
  • ⁇ a third record comprises phonetic interpretation data in a second language; and o tags structuring said information;
  • said concatenated table comprises: o information in the form of records, said records comprising one or more fields; and o tags structuring said information within said records, wherein at least some of the tags describe both a type of a field and its significance within its parent record; information data and display data are the same;
  • the method further comprises, before the step of querying the modified database, a step of selecting one or more file according to a given one or more criterion, wherein the step of querying the database restricts to querying the selected one or more selected files only; the step of selecting one or more file comprises several iterations;
  • the method further comprises a step of querying a relational database; the step of querying the relational database occurs while querying the modified database; and the step of querying the relational database occurs while or after returning said retrieved data.
  • the invention further concerns a computer program product suitable for implementing the steps of the method according to the
  • the invention is also directed to a computerized system implementing the steps of the method according to the invention. It is the belief of the inventor that the efficiency of a method for updating a database and subsequently use of the updated database is dramatically improved, according to the invention.
  • the invention is directed to a method for updating a database from a server to at least one client.
  • Client/Server refers to a network architecture, wherein the client (for example a graphic user interface, likely to run on a computer remote from the server computer), is separated from the server.
  • client for example a graphic user interface, likely to run on a computer remote from the server computer
  • server software generally runs on computers dedicated for exclusive use to running a basis application.
  • client software is likely to run on common computers or workstations. Clients get all or part of their information and rely on the application server for various things such as configuration files.
  • Each instance of the client software can preferably send requests to a server or application server, as will be exemplified later. In the present case, several clients are likely to be involved.
  • the method according to the invention comprises a first step, wherein the client receives database update data and database integrity data.
  • Database update data are preferably divided in blocks, as known in the art.
  • said integrity data can be a checksum (or even a length), which is a simple measure for protecting the integrity of data. Errors in data to be sent through the network are thereby detected. Typically, one sends a value resulting from adding up basic components of the database, typically the bytes. Later, the same operation on the data can be performed on remote PCs, then the result to the authentic checksum are compared, and provided that the sums match, it may be concluded that the update process was not corrupted. Notice that the simplest form of checksum (adding up the bytes in the data) cannot detect a number of types of errors. Thus, one may contemplate using more sophisticated approaches, as known in the art.
  • the method comprises: inserting said update data at a location of a database of the client and verification of the integrity of said database using said integrity data.
  • Said location is preferably chosen so as to minimize subsequent reorganization of the table.
  • the update data are inserted at the end of the client database or table, such that re-structuring the table is not required. The process time is thereby improved.
  • the database modified at the insertion step is a concatenated table comprising information data and, preferably, display data. Accordingly, said update data are preferably sent in a form (for example blocks) suitable for a straightforward insertion in the table.
  • the table is a concatenated table, though possibly dispersed among several files stored on client computers, adding the update data are easily implemented.
  • the table is a searchable table including information data.
  • the table can be locally queried and data retrieved.
  • querying the modified table may comprise sequentially scanning said table, owing to its structure. Sequentially scanning the table allows to dramatically speeding up the usual response time.
  • a request might be sent from the client to the server requesting the update data to be re-sent.
  • said update data are received via one of said networks, while the request for re-sending employs the other of said networks. It is thereby reduced the load on the network intended for broadcasting the update data.
  • the network intended for broadcasting the update data can be a non public network, whereby risks of piracy can be reduced.
  • the table may also comprise display data.
  • said concatenation table may comprise both information in the form of elementary records and tags structuring said information, allowing for example to structure said information in a subsequent display (as will be exemplified later).
  • said display step may make use of said tags.
  • querying the table and subsequent sequential scan are preferably performed without taking account of said tags, so as to maintain a high scanning rate.
  • the concatenated table may also comprise information in the form of a suite of elementary records.
  • a first record may contain a word
  • a second record comprises phonetic interpretation data in a first language (e.g. French)
  • a third record comprises phonetic interpretation data in a second language (e.g. English).
  • Tags can be used to structure said records. Insertion and use of tags will be discussed in details after.
  • the same data can be used for both information (for example to be scanned) and display, which makes it possible using more compact tables. Yet, scanning rates remain high. Notice that the same steps as above can be carried out at each one of said clients.
  • Local queries in the database may typically be achieved via a standard GUI, having usual menu bars that contain a set of user- selectable icons, each icon being associated with one or more operations or functions, as known in the art.
  • said GUI may comprise a query box and a display area for displaying target results.
  • a goods distribution company with a head office and traveling salespeople distributes goods referenced in a product list and wants better customer management at any time.
  • Salespeople are equipped with laptop computers connected to the head office, and must at all times dispose of all elements to file and manage orders (financial elements in relation to each customer, current orders status, list, prices, inventory, etc.) ; they must also dispose of textual information in relation to their customer (visit reports, exchanged e-mail messages, etc.).
  • Trade information can be separated in two categories: information common to all salespeople, list, prices, etc: this information must be identical on all company computers.
  • this sequential price file is constituted by a table in which all the elements, hereafter called elementary items, are stored one after the other, which allows, from a request on an element such as an item identification code, by a simple sequential scanning of the table, to find and display searched elementary items.
  • the last elementary item when an item is deleted, the last elementary item will be a said deletion element meaning there is no more a corresponding article.
  • Another solution consists in marking the one or many items to delete by a code indicating that the item is deleted.
  • the salesperson's computer also contains a prices file said replica prices file which is a replica of the sequential prices file.
  • the replica is obtained in the following way.
  • the new elementary item which has just been created is sent through a telecommunication link to every salesperson's computer using an update data block containing:
  • Each salesperson's computer in addition to the prices file replica, keeps in its memory the number of the last valid update. This ways, when it receives this new update data block, it first checks the update data block number is indeed the one which is expected.
  • the computer computes the control or checksum number after the update, and checks it is indeed identical to the one from the said update data block.
  • An analogous procedure may as well be used to process a group of consecutive elementary items instead of a single one.
  • the computer may receive several disordered update data blocks; in this case the different blocks are stored in a temporary memory, and wait for the whole correct sequence is received before beginning the update process from the temporarily stored blocks.
  • This procedure ensures that all updates are done in the right order, and that the prices files replica is identical to the sequential prices file.
  • One of the advantages of this procedure is that it is possible to use either a wire or a wireless transmission, only in the direction from the head office to salespeople, and to work in broadcast mode, that is, like the Teletex method, have a transmitter or satellite to sends the same information to everyone.
  • the emitter may send repeatedly to totality of the update data blocks for the day, making the temporary storage described earlier all the more useful. It is typically only in the case of a computer failing to synchronize with the head office, for instance following a breakdown, that the computer will establish a link to the head office, and send it the elements that allows initiating a recovery procedure from the last correctly stored elementary item.
  • the replication method described here may be used to obtain an equivalent result at a lower cost. Indeed, thanks to the storage system consisting in putting all events one after the other, one gets a memory usage gain of the order of 10 compared to classical relational databases and document management systems, while allowing a fast access to an information following a request.
  • each transaction be time-stamped, has a sequence number, a checksum on the transaction, a checksum on the duplicated table after the update, that the program that manages the replication checks the process correctness, and finally that the programs used by the company and the trust centre be authenticated, which can be verified by the means of a system of passwords and encryption keys.
  • the invention may propose a concatenated table comprising at least partially encrypted information data and, preferably, display data, stored on a non-volatile memory.
  • Said method may comprise accessing said database, reading a portion of the database and sequentially scanning said read portion of the database.
  • the invention may concern a database decryption method.
  • Said method comprises steps of:
  • a non-volatile memory for instance a hard-disk of a computer
  • the encrypted database is a concatenated table comprising at least partially encrypted information data and, preferably, display data, leading to the advantages described above.
  • this makes it possible to query results of the decryption step and retrieve data contained in said results.
  • querying results of the decryption may comprise sequential scanning of said results.
  • the whole encrypted database is read and decrypted. Loading the whole database in the volatile memory allows for faster scanning of the data.
  • said method may further comprise, before the step of decrypting, a step of verification of the authorization of decryption, so as to prevent from unauthorized access to information.
  • Said verification step may make use of a decryption key or a hardware device, as known in the art.
  • an advantage of the invention is being able to scan at high speed the table which has been previously loaded in the memory of the computer from the disk.
  • the information is stored on disk, it is typically encrypted by the means of an encryption key, and when it is in memory it is in clear text. Therefore, an application that, for instance, is the sole to know the encryption key, does the encryption operation each time the table in memory is saved to disk. Additionally, this application may do the reverse operation (decryption) during the loading in memory, optionally after having checked that this operation is authorized. In spite of all these precautions there are ways to freeze the decrypted contents of the table in memory and save it on a disk.
  • the above mentioned inconvenient is corrected by loading all or a part of a table in encrypted state.
  • the searched information may be encrypted and searched directly in the encrypted data. Else, one has to partially decrypt data as it is searched. This turns particularly useful when information is permanently stored on the volatile memory and never resides in a non- volatile memory.
  • tags structuring said information data may be performed without taking account of said tags.
  • displaying said information data would make use of the tags.
  • the above decryption method may advantageously be implemented together with the method for updating a database described earlier.
  • the decryption method comprises the following steps.
  • the client receives database update .data and database integrity data.
  • said update data are inserted at a location of a database of the client.
  • the database as modified at the insertion step, is a concatenated table comprising at least partially encrypted information data and, preferably, display data.
  • the modified database is stored (updated) on a non-volatile memory. Then, it is proceed to a verification of the integrity of said database, as described earlier.
  • the modified database is accessed and it is read at least a portion of the modified database.
  • the read portion is decrypted on-the-fly, preferably if an authorization is confirmed and using a decryption key. Finally, results of the decryption step are stored on a volatile memory only.
  • This customer event file is also built in the form of a sequence of elementary event items that may be scanned to find information related to a customer.
  • This information is produced at the level of the salespeople's computers, and generally will be used by the salespeople themselves; however, it may be useful to make this information available to the head office.
  • a solution to this problem consists in having an update system similar to the one described above so that the head office server contains a replica of all the customer event files of the salespersons that deal with them.
  • Another solution less costly in telecommunication link traffic, consists in having only one instance of the information, in the salesperson's computer, and to consider the global company customer event database as a group of elementary databases.
  • each client has its own database, which can be viewed as a part of said delocalized database (each computer may assume the role of server or client depending on the situation).
  • each client database is a concatenated table (possibly encrypted) with information (and possibly display) data stored as elementary records
  • said method for accessing information content comprises a first step in which a number of clients receives a request relative to information content sought, for example from the server itself or from one of the client computers. Said request is adapted for triggering sequentially scanning the entire or part of a client computer database. If pertaining information is found, it is then uploaded to the server or requesting PC.
  • the invention may propose a data processing method, wherein, according to the result of a user action, the method comprises a step of accessing a database, the database being a concatenated table comprising information data as elementary records and, preferably, display data. Further, the table comprises tags for structuring said information. Said method further comprises, in any order:
  • Said method is likely to include both steps of sequential scanning, the order of which depends for example on user actions.
  • the records in the file are scanned while the tags are ignored, allowing high speed retrieval of content, owing to the features of the database, as discussed above.
  • the records in the file may be scanned while taking the tags into account, making it possible accessing and using data which are structured according to said tags.
  • This second step is particularly convenient for a display step, wherein displayed information need be structured for visual comfort.
  • the database or file may be partially or fully encrypted, so as to allow for decryption on the fly, as explained earlier.
  • the decrypted results would therefore exist in the volatile memory only, even if displayed, so as to improve the security of the method.
  • One of the advantages of the method described above is to allow storing data one after the other in an elementary item. Other aspects of the method are described below.
  • Another way of proceeding consists, at least for part of the data, in using a system of mark-up tags such as the one found in the HTML or XML formats
  • sequence '0x4-b' (0x4 is a value expressed in hexadecimal) means start of a character zone displayed in bold, and '0x5-b' end of zone, etc.
  • tags are taken into account like it is done with texts displayed on the Internet. This allows avoiding duplicating information, once for searching, once for display.
  • sequence 'e-0x7-e' means a character comparison with 'e' or 'e ⁇
  • a given tag may mean that the next 4 bytes that follow must be considered as a signed or unsigned integer, as a date, or as an amount in a given currency, for instance in Euros with two digits after the point.
  • a coding of hypertext type allows to link to other data stored remotely on the Internet for instance, or on disk.
  • Access rights management tags may indicate if the current user has the right to read, or modify, or delete elementary articles.
  • An access right tag is constituted by any number of group or user identifiers and permission masks. This allows for access right management similar to the one found in classical database or operating systems.
  • the replication method allows building an economical and a cost-effective to archive static data such as bank transactions of several millions customers for several years, and to have a replica of this database off-site or at in custody of a trusted third party.
  • tags allows handling intuitively the transition phase during a currency change (like the French Franc to the Euro.) Indeed, using two different tags, one would have for instance
  • One or the other of this information may appear, or both may coexist in the same element, without any ambiguity at the moment of searching, and it is therefore unnecessary to reorganize the database. This is already appreciable in the case of huge data sets. It is even more so when the database is replicated to different places, especially if the information is located at a trusted third party without access.
  • the methods presented earlier have the particularity of using the sequential scanning of a table in memory to find information, and at the moment of displaying the result, using all or a part of the said table.
  • One goal of the present invention is also to show how one may use such methods in combination with disks or relational databases to access rapidly to archived information.
  • a real-time system that is, a system capable of managing correctly operations of all nature that may impact the same information in different places, for instance a flight booking system, and bank operations in the current bookkeeping day.
  • V.I.1 Disk reading and table scanning
  • a proposed solution consists in storing sequentially in a table, all the said customer events, in the form of data blocks one after the other and using item identification code, formatting, delimiter and tag techniques. Later on, as described above, thanks to a simple sequential scanning of the said table in memory, one may find very quickly a customer event, and extract the information in order to display it. As the case may be, information is encrypted on disk.
  • a hard disk On a hard disk, one creates a tree of folders corresponding to the geographic structure of the bank, for instance country, state, branch. Then in the folder corresponding to the branch, one creates one file per customer, and one puts in this file the totality of the customer events concerning him or her. In this way, one will find on the disk for the said bank 5 million files distributed in about one thousand branch folders. Obviously, nothing prevents to split the branch folder in subfolders each corresponding to a group of customers, hi the same way, the information on each customer may be split in several files, according to the nature of the information, that is, numerical, e-mail, texts, etc. Also, a single file may gather diverse information related to the same customer, or even several customers. To accomplish this, it suffices to generate the file path from the account number and information requested.
  • Associating the customer account number to the said customer event may be done automatically from the e-mail addresses contained in the message, or the account manager manually does it at the moment of sending or receiving the message.
  • the enrichment operation of the said customer file with text-type customer events of the day may be done at night, or progressively at the end of the automatic or the manual customer number process.
  • This mode of storage and querying is particularly adapted when the search is done from an identifier internal to the company, such as a customer number or an account number, or a service number for personnel, etc.
  • Response times and the number of requests that can be processed simultaneously depend essentially on the speed of reading one or more files from disk and on the loading of the temporary table in memory, because the scanning time in memory can be very fast.
  • one or more computers can be added with exactly the same files on disk, working in parallel.
  • the method is appropriate to store the said customer events.
  • a real-time system that is, a system capable of managing correctly operations of all nature impacting the same information simultaneously in different places, for instance a flight booking system, and bank operations in the current bookkeeping day.
  • This mode of storage and querying is particularly interesting when the information contain an identifier such as a customer account number, a service number for human resources, a phone number for telephone operators, a social security number, etc., and as long as the search is always done on one identifier at a time.
  • an identifier such as a customer account number, a service number for human resources, a phone number for telephone operators, a social security number, etc.
  • search is not done on an identifier as described above.
  • a simply way to solve the problem consists in limiting the number of customer files to read, as described below. Every night, at the moment when one extracts the customer events of the day from the relational database, one selects the transactions corresponding to inter-bank transfers and for each on of them, one generates a record said transfer-item containing two fields:
  • bank coordinates are composed only of numbers, and they can be coded directly on 64 bits; else a simple conversion program can do it.
  • date- separator containing a tag such as described in the invention, the date of the bookkeeping day and the number of transfers of the said day.
  • V.3 Complementarity example table supplemented by a relational database
  • An inconvenience of searching by scanning is that it is poorly adapted when there are hierarchical relations between different information, as in the following example.
  • each e-mail message as well as to each attached document is associated a unique identifier, which helps to avoid attached document duplication, which belong to several messages.
  • a unique identifier To link a message to its attachments, one may store in each e-mail item the list of is attachments identifiers, but if one deletes a message from the table, one may produce orphaned attachments, and the whole loses coherence.
  • this device allows passing from one account to another and consolidate all customer information.
  • this device allows associating different elements contained in tables according to the invention.
  • the method according to the invention is composed of two phases, a first phase consisting in doing the search in the tables according to the invention, and then a second phase during which a relational database is used to refine the search and/or display information not contained in the tables according to the invention.
  • the classical technique consisting in doing first the search in the relational database, then from the obtained results, then doing a search in the customer event file (or the reverse) can be extremely slow.
  • Such an organization allows managing the search of a customer number according to a series of criteria related to information contained in the relational database as well as in a customer event table, by the means of a table described above, and using the relational database to display or process the information of a given customer.
  • Action_i may be an action such as: read a table from a disk file: for instance LoadFromDisk() according to the user's access rights.
  • DATA_BASE keyword indicating the database that contains the customers bank transactions of the bank.
  • RESULT operator to get the status code resulting from an action.
  • the language allows describing the database according to the invention, either from a specific simple language, either from SQL-type commands (CREATE TABLE, CREATE INDEX, etc.)
  • tags reserved for this purpose begin at the 0x80 value, indicating the next field, the transaction date.
  • One builds a table with 3 columns, The 1 st column contains the tag value (that is 0x80)
  • the 2 nd column corresponds to the type, that is UTC DATE, a date on 32 bits in the UTC convention, this type will be used in operations on dates,
  • the 3 rd column contains the text of the field name used in the said language, that is
  • the invention is furthermore directed to a script, a computer program product and a computerized system comprising code means, suitable for implementing the steps of any of the above-described methods.

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Computing Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

L'invention concerne un procédé pour mettre à jour une base de données d'un serveur à au moins un client comprenant : - la réception par le client de données de mise à jour de base de données et de données d'intégrité de base de données ; - l'insertion desdites données de mise à jour à un emplacement d'une base de données du client ; - la vérification de l'intégrité de ladite base de données à l'aide desdites données d'intégrité, la base de données modifiée à l'étape d'insertion étant un tableau concaténé comprenant des données d’informations, et de préférence des données d'affichage.
PCT/EP2005/014210 2005-12-14 2005-12-14 Procédé et système informatique pour mettre à jour une base de données d’un serveur à au moins un client WO2007068279A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2005/014210 WO2007068279A1 (fr) 2005-12-14 2005-12-14 Procédé et système informatique pour mettre à jour une base de données d’un serveur à au moins un client

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2005/014210 WO2007068279A1 (fr) 2005-12-14 2005-12-14 Procédé et système informatique pour mettre à jour une base de données d’un serveur à au moins un client

Publications (1)

Publication Number Publication Date
WO2007068279A1 true WO2007068279A1 (fr) 2007-06-21

Family

ID=36729271

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2005/014210 WO2007068279A1 (fr) 2005-12-14 2005-12-14 Procédé et système informatique pour mettre à jour une base de données d’un serveur à au moins un client

Country Status (1)

Country Link
WO (1) WO2007068279A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7953744B2 (en) 2009-01-28 2011-05-31 International Business Machines Corporation Database change verifier
US8767019B2 (en) 2010-08-31 2014-07-01 Sovanta Ag Computer-implemented method for specifying a processing operation
US8972467B2 (en) 2010-08-31 2015-03-03 Sovanta Ag Method for selecting a data set from a plurality of data sets by means of an input device
US9612742B2 (en) 2013-08-09 2017-04-04 Zoomdata, Inc. Real-time data visualization of streaming data
US9811567B2 (en) 2015-02-27 2017-11-07 Zoomdata, Inc. Prioritization of retrieval and/or processing of data
US9942312B1 (en) 2016-12-16 2018-04-10 Zoomdata, Inc. System and method for facilitating load reduction at a landing zone
CN110830331A (zh) * 2019-12-06 2020-02-21 中国交通建设股份有限公司 一种物理模型试验过程数据传输系统和方法

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5926816A (en) * 1996-10-09 1999-07-20 Oracle Corporation Database Synchronizer

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5926816A (en) * 1996-10-09 1999-07-20 Oracle Corporation Database Synchronizer

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
"A Replica Management Service for High-Performance Data Grids", GLOBUS DATA MANAGEMENT GROUP, 18 August 2000 (2000-08-18), pages 1 - 15, XP002393836, Retrieved from the Internet <URL:http://www.globus.org/toolkit/docs/2.4/datagrid/deliverables/ReplicaManagementService.pdf> [retrieved on 20060807] *
S. KOSYAKOV, J. KOWALKOWSKI, D. LITVINTSEV, L. LUEKING, M. PATERNO, S.P. WHITE, LAURI AUTIO,: "FroNtier: High Performance Database Access Using Standard Web Components in a Scalable Multi-tier Architecture", CHEP04, 2004, XP002393837, Retrieved from the Internet <URL:http://indico.cern.ch/getFile.py/access?contribId=204&sessionId=7&resId=1&materialId=paper&confId=0> [retrieved on 20060807] *
SABARATNAM M ET AL: "Cost of ensuring safety in distributed database management systems", DEPENDABLE COMPUTING, 1999. PROCEEDINGS. 1999 PACIFIC RIM INTERNATIONAL SYMPOSIUM ON HONG KONG 16-17 DEC. 1999, LOS ALAMITOS, CA, USA,IEEE COMPUT. SOC, US, 16 December 1999 (1999-12-16), pages 193 - 200, XP010366601, ISBN: 0-7695-0371-3 *

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7953744B2 (en) 2009-01-28 2011-05-31 International Business Machines Corporation Database change verifier
US8767019B2 (en) 2010-08-31 2014-07-01 Sovanta Ag Computer-implemented method for specifying a processing operation
US8972467B2 (en) 2010-08-31 2015-03-03 Sovanta Ag Method for selecting a data set from a plurality of data sets by means of an input device
US9612742B2 (en) 2013-08-09 2017-04-04 Zoomdata, Inc. Real-time data visualization of streaming data
US9696903B2 (en) 2013-08-09 2017-07-04 Zoomdata, Inc. Real-time data visualization of streaming data
US9946811B2 (en) 2013-08-09 2018-04-17 Zoomdata, Inc. Presentation of streaming data
US9811567B2 (en) 2015-02-27 2017-11-07 Zoomdata, Inc. Prioritization of retrieval and/or processing of data
US9942312B1 (en) 2016-12-16 2018-04-10 Zoomdata, Inc. System and method for facilitating load reduction at a landing zone
CN110830331A (zh) * 2019-12-06 2020-02-21 中国交通建设股份有限公司 一种物理模型试验过程数据传输系统和方法
CN110830331B (zh) * 2019-12-06 2024-03-15 中国交通建设股份有限公司 一种物理模型试验过程数据传输系统和方法

Similar Documents

Publication Publication Date Title
US7346633B2 (en) System providing methodology for replication subscription resolution
US9524306B2 (en) Global information management system and method
CN101561815B (zh) 分布式密文全文检索系统
US8782096B2 (en) Virtual repository management
US7263521B2 (en) Navigation of the content space of a document set
US6826557B1 (en) Method and apparatus for characterizing and retrieving query results
US8112453B2 (en) Systems and methods for retrieving data
US6035303A (en) Object management system for digital libraries
CN100424704C (zh) 基于密文的全文检索系统
US10104021B2 (en) Electronic mail data modeling for efficient indexing
US20020156779A1 (en) Internet search engine
US20040133561A1 (en) System and method for identifying alternate contact information
EP1763796A2 (fr) Indices de tableaux cryptés et interrogation de tableaux cryptés
US7895224B2 (en) Navigation of the content space of a document set
WO2007068279A1 (fr) Procédé et système informatique pour mettre à jour une base de données d’un serveur à au moins un client
WO2001065410A2 (fr) Moteur de recherche sur l&#39;internet
JP2005122606A (ja) 情報閲覧装置、情報閲覧システム、及び情報閲覧プログラム
EP1304630A2 (fr) Système de génération de rapport
JPH07182355A (ja) 情報保管・検索システム
US20060059210A1 (en) Generic database structure and related systems and methods for storing data independent of data type
WO2003007525A2 (fr) Systeme et procede permettant d&#39;integrer des equipements de stockage electroniques
JPH07121425A (ja) ファイリングシステム
MXPA00012346A (en) Data retrieval method and apparatus with multiple source capability
JPH0652021A (ja) ファイルソートアクセス方式
JPH06110757A (ja) データ管理方式

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 05824376

Country of ref document: EP

Kind code of ref document: A1

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载