• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    This invention discloses a computer-implemented method and device for processing structured data and generating standardized output data. The invention discloses a first phase (60) for storing the structured data in a data storage, and a second phase for determining (67) a unique data element identifier value, wherein the unique data element identifier is determined for a series input data values (51). Thus, this invention is an efficient and good technique for storing and identifying data values from a document or a general, or specific, undefined data stream without the requirement to manually assign a source data element identifier value to a set of input data values (51) for generating document, in particular standardized output data, in particular electronic receipts.
    公开号:BE1024445B1
    申请号:E2017/5376
    申请日:2017-05-24
    公开日:2018-02-27
    发明作者:Gunther Weyts；Wim Derkinderen
    申请人:Xpenditure Nv；
    IPC主号:
    专利说明:

    (30) Priority data:
    26/05/2016 EP 16171581.8 (73) Holder (s):
    Xpenditure NV 2800, MECHELEN Belgium (72) Inventor (s):
    WEYTS Gunther 9820 MERELBEKE Belgium
    THIRD CHILDREN Wim 2800 MECHELEN Belgium (54) Method and device for processing structured data and generating standardized output data (57) This invention discloses a computer-implemented method and device for processing structured data and generating standardized output data. The invention discloses a first phase (60) for storing the structured data in a data store, and a second phase for determining (67) a unique data element identifier value, wherein the unique data element identifier is determined for a series of input data values ( 51). Thus, this invention is an efficient and good technique for identifying and identifying data values from a document or a general, or specific, undefined data stream without the requirement of manually assigning a source data identifier value to a set of input data values (51) for generating of document, in particular of standardized output data, in particular electronic receipts.

    BELGIAN INVENTION PATENT
    FPS Economy, K.M.O., Self-employed & Energy
    Intellectual Property Office
    Publication number: 1024445 Filing number: BE2017 / 5376
    International Classification: G06F 17/30 Date of Grant: 27/02/2018
    The Minister of Economy,
    Having regard to the Paris Convention of 20 March 1883 for the Protection of Industrial Property;
    Having regard to the Law of March 28, 1984 on inventive patents, Article 22, for patent applications filed before September 22, 2014;
    Having regard to Title 1 Invention Patents of Book XI of the Economic Law Code, Article XI.24, for patent applications filed from September 22, 2014;
    Having regard to the Royal Decree of 2 December 1986 on the filing, granting and maintenance of inventive patents, Article 28;
    Having regard to the application for an invention patent received by the Intellectual Property Office on 24/05/2017.
    Whereas for patent applications that fall within the scope of Title 1, Book XI, of the Code of Economic Law (hereinafter WER), in accordance with Article XI.19, § 4, second paragraph, of the WER, the granted patent will be limited. to the patent claims for which the novelty search report was prepared, when the patent application is the subject of a novelty search report indicating a lack of unity of invention as referred to in paragraph 1, and when the applicant does not limit his filing and does not file a divisional application in accordance with the search report.
    Decision:
    Article 1
    Xpenditure NV, Frederik de Merodestraat 86A, 2800 MECHELEN Belgium;
    represented by
    GEVERS François, Gateway Building - Airport National 1J, 1930, ZAVENTEM;
    a Belgian invention patent with a term of 20 years, subject to payment of the annual fees as referred to in Article XI.48, § 1 of the Code of Economic Law, for: Method and structure for processing structured data and generating standardized output data.
    INVENTOR (S):
    WEYTS Gunther, Waterkant 17, 9820, MERELBEKE;
    THIRD CHILDREN Wim, Frederik de Merodestraat 86A, 2800, MECHELEN;
    PRIORITY:
    26/05/2016 EP 16171581.8;
    BREAKDOWN:
    Split from basic application: Filing date of the basic application:
    Article 2. - This patent is granted without prior investigation into the patentability of the invention, without warranty of the Merit of the invention, nor of the accuracy of its description and at the risk of the applicant (s).
    Brussels, 27/02/2018,
    With special authorization:
    BE2017 / 5376
    Method and apparatus for processing structured data and generating standardized output data
    Background of the Invention 5 Dehted an de uh s mu ing
    The present invention relates to a computer-implemented method and apparatus for processing structured data, preferably printed data and data received via API services or file transfer, and for generating standardized output data. In particular, this invention relates to the opsian and identification of these data for generating. documents. preferably standardized output data, In the case of 'd O ' - U 'a- ·' -. '
    Description of the prior art
    Data has become an important asset in everyday life. Despite the existence and popularity of electronic devices such as smartphones and computers, a lot of data is still printed and preferably read on paper. This also applies to paper receipts because they are simple and practical to perform quick checks, but in the digital world they will quickly die out.
    Digital or electronic receipts will become increasingly important in the everyday business world because they offer benefits to all parties to one
    OOO. , '' 000> - '0 - , 25 communication with their customers. Standardized (electronic) receipts will provide customers. of a more efficient working method of data storage and of hot data retrieval. In addition, standardized (electronic) customers will be able to work with other partners oo: neu -an eon s audanrdwerl-wn m to obtain sales information for data passes. of pto-do and promotion cycles, which streamlines the processing of warranty and discount claims, and assist in efficiently resolving credit card purchase disputes between. sellers and banks.
    BE2017 / 5376
    Attempts to digitize paper quantifications are known from the prior art. For example reveals. EP2677481 A system and method for recording receipt receipt data. A receipt image processing service selects a template from a repository that accompanies the data recording of receipt data from a receipt image and presents the template to a user on an image recording device. A user views the preview of the receipt statement and the selected template. If the user decides that the template does not correctly indicate the locations of the data areas for data units in the receipt image, then the .10 user either updates an existing template or creates a new template that is the location of the selected data areas in the receipt image. correctly indicated e. The selected template, the updated template, or the new template is then used to obtain receipt data from the receipt derivation. The receipt data and receipt deduction data are then provided to the expense reporting system.
    Really, this opAswng does not specifically provide a solution to the problem of the data structure (ie, relationship between data values) and data values of the data source in the data processes. a common description, metadata value or a source data entity identifier.
    base. This affects the performance of identifying a range of originally undefined data values.
    A commonly believed solution to this technical problem, while existing computer systems used by vendors, banks and other financial institutions are complex and sophisticated, manually assigning a description, ie the source data entity identifier, to a third party. of data values. z.o generate electronic documents.
    Summary of the invention
    One of the objects of this invention is to provide an efficient and high performing technique to store data values and identify from a
    BE2017 / 5376 document or a general, or specific, undefined data stream without the requirement to manually assign a value of a biondata element identifier to a list of data values.
    In -, v>. -,. >, 'u, <w method for just processing structured data, whereby the. structured data included 1a in a data source, the method comprising a first phase for storing the structured data comprising the successive steps of,.
    a. receiving the data source by means of bed processing data;
    b. determining a data structure of the data source from a first set of source data entities using the data processing means:
    c, deducting from the data structure on a first data structure object in a memory, the first dm. straw unreinem comprising a luondua entity identifier value, a first unique identifier value and a row time and t if 1 value;
    d, determining a data value, a data value type and a source data element value for each data item in a first recks of DNA not vau. the d.dabion with use wm h ;; nudd-'l vom bet, C: v cm
    e. defining the data value, the data value type and the first unique identifier value on a first data value object with the memory store the first data structure object in the data store in the data store and stored in the memory; irde-ohu i mut
    It has been found that, through the cet '<>. These successive steps. the relationship between data entities and data can be stored in a data storage in a more efficient manner compared to XML storage. In addition, this eomptiier-implemenated method also allows the storage of data values of the data elements, with which the possibility to; is established to properly transfer the data structure from the data source
    BE2017 / 5376. This also provides the advantage of retrieving data values and their relationship to arid data elements, even when the data source file is not stored.
    In a preferred embodiment of the invention, step b comprises. from determining the data source of the data source from a first set of source data entities using the data processing means, the following successive steps for each data entity of the first set of data entities:
    b.i determining a data level », where n is a positive integer equal to sors or less w than Ο, b, 2 determining the source data entity identifier;
    b.3 assigning the first unique identifier value;
    b.4 the matching of the master currency alor value, the mover identifier value being equal to a second unique identifier value of a daia entity at a data level -1 -1, further comprising the assignment. from a NU'LL value to the ', OO 0' '0' <·, 0 '·, · ""
    It has been found that, by combining these steps, it is possible to determine the data structure of data in an efficient manner without the need to uni i mg im 'wi md tu ^ en d ·'. i - «. :: mow to bop ι a t
    According to a preferred embodiment of the invention, the step d comprises step d. from determining the data value, the data value type, and the source data element identifier for each data element of the first set of data elements of the data source using the data processing means, the following sequence is successive 'Dappon for my duta-doomm ran first set of data elements:
    d.l hvt btpa'.on from 'k datawa udt
    BE2017 / 5376 d, 2 determining the source data element identifier value and the first unique identifier stored in the data structure object in the memory;
    d.3 determining the data value type of the data value.
    According to a preferred embodiment of the invention, the method for processing structured data, a second phase for the determination of e and unique data elenaentsidenitficatorwaarde, wherein the unique dataelementldentifleator is determined for a range of input data values (51), wherein the second phase, the following , preferably consecutive, steps for each input data value, g, determining a report file in memory, the steps comprising karr:
    g.l determining a series of identical data values from the data value15 object stored in the data storage, whereby the identical
    J oaeeawk ee Jot; w ... Je 'J: ·, ce uk u oan „e msooi eana nd,,
    i. 3 hey, γ :. '*>: d tu e iwuw ί \ e e r-k - now the data store, where the source data egg identifier value is selected from the data structure object using
    Your first unique ident ificatoä value for the identical data values determined in step g.l;
    g.3 storing the sequence of source data requirement identifier values in the report file in memory;
    h, determining whether the unique data element identifier value can be derived from the in-memory report file, wherein the unique data element identifier value is the unique and common data value for at least two input data values;
    i, repeating step g. and step h, for a next input data value in the event that the unique data artidilizer value could not be derived in step h.
    BE2017 / 5376
    It has been found that, by combining these steps, a unique data entry identifier value can be obtained for a series of input data values, the series of input data values preferably being selected from different data sources, in an efficient and good manner since there is no requirement to manually create a unique lot t knee uweku i î, x .u », to assign value to a range of input data values. This method also provides the x> '- kcl of the Ee ^ tken wm ce i bgen · snetiun on ^ ivti ongi-kw cat' m let 'n' '' ce , e> x '', - .c w
    In a preferred embodiment of the foregoing aspect of the invention, the invention provides a, c 'xx. 'x i' x c 'C -> de waauv too dx unixk' 'Homi i c.den tt.x.mnwa nd. to be extracted from an output object, vvaaiby the mtxoerxibfect run at least one data value of the input data value.
    In evn. According to the invention, the second stage for determining the unique data element identifier value further comprises step j, after step i. to map the unique source data element identifier to a. owl output object, wherein the owl output object comprises at least one input data value.
    In addition to a preferred embodiment of the invention, the invention provides a method of generating documents, in particular standardized output data, in particular electronic receipts.
    An advantageous effect of the invention is that documents are generated on a suede and efficient nnuuci because xr gx and necessc ink is to know bmdm.thg umeke data -clcments identifier values on a range of data values.
    According to a preferred embodiment of the invention, an computer-recorded device facilitates processing data by the method of any one of claims 1-7, wherein data is contained in a "0" x x "C. 'xx CO' U '. C' '0 X CO C x x X,,' O, x, o ''.
    BE2017 / 5376
    a. means for obtaining the data source, the data source being data emiml and and dam-c'en ^ nu'ii w-w, u
    b. a means for determining a data structure of the data source:
    e. means for determining data values of the data source;
    d. a means of storing. a data structure object and a data value object in a data store; and e, a means for determining a unique data element <ni'ode: Uifn'nn> rv; iUide for an undoubted growth value.
    'w. red m <to <'.rmg-' it catches no eye; jr, xn computer readable medium computer implicit instructions which, when executed by a system element, prompt the system element to execute a method according to any one of claims 1 to 7.
    Brief description of figures
    The features are particularly described in the claims. However, the invention herein is better understood by referring to the following detailed description of an example of an embodiment, along with the accompanying figures, a description in which Figure i is a schematic representation of dala sources received by a means for processing data:
    Figure 2 is a schematic representation of an XML-formatted data source comprising two data groups, various data entities and data elements;
    Figure 3 is a flow chart showing the various steps to generate a data flow object file and data value object file in a data store according to a preferred embodiment of the present invention;
    • Figure 4 is one. schematic representation of a, s <·. .v ·>,. m. '<' s. M. " k " is a preferred embodiment of the present invention;
    BE2017 / 5376 «Figure 5 is a schematic representation for identifying a value of a unique source data element identifier value for a list of data values;
    • Figure 6 is a schematic representation of the steps to store structured data included in a data source, followed by the steps to determine a unique data element identifier value.
    Detailed description of the invention
    The present invention will be described in relation to the certain embodiments and referring to certain figures; however, the invention is not limited thereto but only by the claims. The figures described are purely schematic and not limiting.
    Furthermore, the terms first, second, third and the like in the description and in the claims are used to distinguish between different comparable elements and not per se for describing an order, whether temporary, spatial, in order or on any other way. It is to be understood that the terms as used under suitable conditions are interchangeable and that the embodiments of the invention which describe beer are in. be able to work in voices other than those described or illustrated herein. It is to be noted that the term "include" as used in the claims is not to be construed as limited to the means hereinafter; the term shut no other elements or steps out. The term is therefore to be interpreted as specifying the presence of the stated attributes, integers, steps or parts as referred to therein, but does not exclude the presence or addition of one or more other attributes, integers, steps or parts or groups thereof. Thus, the scope of the phrase "computer-implemented system comprising means A and 3" should not be limited to directions consisting only of parts A and B. It means that, with respect to this invention, the only relevant parts of the devices A and B are, Reference to, in all respects «of this specification,“ one embodiment ”or“ an embodiment ”means that a particular feature, structure or characteristic
    BE2017 / 5376
    X V x '. At least one embodiment of the present invention is at least one of the present invention. So, occurrence of ds phrases "in one embodiment" or "in one embodiment" on "x. 'W CSSx x x' 'χ' x '.χ X X' 831 'same u Tvi> «rings, but they can. Furthermore, the particular features, structures or characteristics can be combined in any suitable way, such as from. this disclosure would be apparent to someone with general skills at work, in one or more embodiments. Likewise, one should be aware that in the description of exemplary embodiments of the invention, various features of the mu Hiding sent gm-epecixi are shown in some embodiment, figure, or description thereof with the duet on. the disclosure to be streamed et to support the understanding of some or all of the fresh inventive aspects. The method of disclosure, however, should not be interpreted as being an iix. -kn dr gvknn-k .d '.'- nh · .; u ·. · kxi.neixx :: n'a'i Λ : ', are explicitly mentioned in every conclusion. The inventive aspects, as the following claims express, lie rather in less than all of the features of a single previous embodiment. So the conclusions follow the detailed description, each conclusion stands alone as a .uge.-'-Ndxrd · mweckugwoim .m dx.e m-n 'ndum,
    Furthermore, some of the embodiments herein have been described as a, x '' x x '-χ' 'χ χ. 'x' 'x'x method that implemented
    x.l'xx .kllx'x'x '. xxn t'llW'Vx '. xx x · ΐΡ | : χ’χχχ \ 1χ ',' k <! , 'x x'Cx'.x'EU' .- '. Χ χ x'x χ' χ 'XX S χ X' XX Sx 'x' XX x'x X xX Χχ'χ 'perform so a method or element of a method constitutes a medium of the method or element of a method. Furthermore, an element of an uirwtrttngsu.t'oe.iogiwnn xhu Inen i xwohw'.eu ex.n '.ootbceUt of a means for carrying out the film which is carried out by the
    X xx xx 'x'x't. x'x'x xW dx 'x x. ".. i; χ xX ’χ '' XX. x'x '' xix ''> 'x x' 'x''X xxX bxWhuwmg become tele spe'.dteke detx ils ' 'îgexhagen bxhiei he' n »datxkhik that embodiments of the invention can be used without these specific details . 1t other cases are known methods, structures and
    BE2017 / 5376 techniques are not shown in detail to a m .up vw lese ci wn. m to make unclear.
    The following terms are provided only to aid in understanding the invention. As used in this application, the terms “part /” are eu
    Xystem ”intended to be located near a computer-operated entity, either hardware, a combination of hardware and software, software or software in progress. For example, a part that is not limited to being can be a process running on a processor, a processor, an object, an executable, an execution thread. a program, and / or a computer. M ", 1," ta ; . i both an application running on server and server are a part. One or more parts may be in a process and / or execution thread, and a part may be located on one computer and / or distributed over two or more computers.
    Referring now to the Figures, and in particular Figure J. and Figure 6, Figure 1 illustrates a schematic representation of sum structured data contained in a data source 11 received by a data processing means 12. Formats of the data sources can be XML, JSON. ill MT .., Y AMI .. Excel, ie. include.
    Examples of data sources 11 which include structured data may include digitized paper documents 15 as obtained by Optisehekurakierhcrkennings (Optical Character Recognition, OCR) software 13, and external BM streams, such as those from web content 14. Therefore, or an application eo hx s.mnntr '.m papw'.m iwl t as well as web services 14 serve as endpoints to send data as asynchronous messages from one endpoint to the data processing means 12. The data sources can be sent through Windows t '· η' · ' : ·· η pie: i> wdnf m ; \ Cl s vD ·>('ftfv i λ El''In
    According to the preferred embodiment of the invention, method implemented for storing structured data 60, wherein the structured data is contained in a data source 11, the storage phase comprising the successive steps of;
    ir
    BE2017 / 5376
    a. receiving 81 from the data source 11 by a data processing means 12;
    b, determining 62 a data structure of the data source 11 from a first set of source data entities using the means 12 for processing. data;
    e. displaying the data structure 83 on a first data structure object 41 in the memory, the first data structure object 41 has a round data sensitivity value when value 44. a first unique identifier value 42 and a mood value. .v -, ".D 43 on",
    d. determining 64 a data value 27, a data value type 46 and a source data 10 data identifier value 26 for each data element 23 in a first set of data elements of the data source 11 using the data processing means 12;
    e. mapping 65 of the data value 27, the data value type 46 and the first mo bkmmk j value 42 on a first data value object 48 in memory;
    f. storing 66 the first data structure object 41 in memory and the data value object 48 in memory 49 in a data store 49.
    p ---, Wed. -W. . -s, e ,, -, -, ,,, -, e, tc.-0.-.- see. ' , s'. Jo , - s, -w. .., -, a series of values that are obsolete by the distinguishing character. Examples of a distinguishing character can include a comma character, a simple biohook, duhbele biohook, etc.
    The data source 11 may include various formats such as XML, ISON, HTML, YAML, Excel, etc. Referring to Figure 2, an XMJ.-formatted data source 21 comprising structured data is demonstrated. The data source 21 in Figure 2 comprises two valley handles 24. A data source comprises at least one data group 24. A data group comprises a collection of data entries 22 and data elements 23.
    A data group 24 can be generated for each uuhttdutei p.ipuoen
    A-u-., N 15 or I. Π, h. M; -, -, -X =.
    data source 21 includes data eMuenen 22 and datw-Hemeotvn 23. As referenced in this application, a duta entity 22 should be interpreted
    BE2017 / 5376 as an entity of the data source that is credited with at least one metadata value or a source data element identifier 25. For example, referring to Figure 2, the data entity 22 <1D> 'is identified with the source entity identifier 25' ID ' . The value of the source data entity identifier dè e, <'s -. <', -, \>' '' ',', can also be a data file Data entities 22 that belong to the same data source 13 or data group 24 can eek.de mo'd, emewUi, nsmwau;,. Me 25 to have.
    A data entity 22 includes at least one data element 23, while data elements 23 are identified by means of a data network or source data. do ,, 1 ',. , graft identifier, in most cases, provides a description of the data value 27. For example, referring to Figure 2, data values '38' and '42' may be references to the 'age', i.e. the source data identifier 26 of. the third data element that belongs to the data entity 22 "<ID>". Data elements 23 have no other data entities 22 or lorn Den - .. n ·.!, 23 on e.w.
    Data entities 22 and data elements 23 are used to describe the structure of the data source 31, regardless of the value of its source data entity identifier 25 or source data element identifier 26, The data source 31, 'hwecu d • Uss'.i.jcin: .; · V t. : b · "ews. ctm.- χ 1.41 notd: i'- .e i loneephieel daromodci da · D dai.i-eumeneu 22 <.n duoi-ekreen'eo 23 and am documenting connections, as well as the limitations associated with them. The mutual relationship between data entities 22 and data elements 23 is for the purpose of describing the structure of the data source 11.
    Therefore, it becomes a data level. always assigned to each data entity 22 and each datant element 23, in particular, it is necessary to create other data entities within a data source II. As described in this application, data theaters 22 vp have the highest nttean, ie the root level.
    BE2017 / 5376 a data level of zero fG). Data entities 22 at the first saber root level have data level 1, offsets 22 or data elements 23 that belong to data entities 22 at data level i have data level 2, and so on. For example, referring to Figure 2, the data entity 22 of the first data set 24 is contained within the data source It at datait! ', Eau tnd. The dmu eggs identified with the source data end identifiers 26 surname '(' nickname '), Marne' Dname ') and' age '(' time ') are located at data level 1,
    Also a preferred embodiment. of the invention, data elements 23 are to be viewed as daia entries 22 at both the lowest data levels within an input data end. In other words; datn eon monies 23 at data level n do not include data entities 22 at data level n-, n being an integer greater than or equal to zero (0). Referring to the data source 2Î formatted with XML in Figure 2, the first recks of data entity n is <ID> j.
    The example referred to in Figure 2 is formatted in XML. A comparable footprint formatted in JSON would look like this:
    ÎXML kïDzI <surnsrae> lohn <· 'surnamesI - u, mw btitoti - nmne <age> 38 </age>
    I </ID>
    ID: j surname '': John L name: Smuk, aue: 38
    The specifications defined above for the terms such as "• data entity", "data element". "Data level" are not limited to data sources tl formatted in XML but are also applicable to data sources II in other formats such as .ISON. HTML. etc.
    Figure 3 depicts a flow chart according to a preferred form of the information about the data structure and data values of a data source. 11 te siaan.
    BE2017 / 5376
    According to a first step, steps 32 33 34 35 are performed to determine the data meta ra 4 that can be determined by hot parsing through data source 11 by means of a parser. The data source 1 ί comprises a first series of data entities for which a data level n is determined for each data entity.
    According to the aforementioned definition of data entities 22 and data elements 23, the first set of data entities also includes data elements. 23, i.e. data entities 22 with a data value 27 on without any data entity 22 at a lower data level.
    Following actions 32 33 ora to determine a data level n and a value of the source data security identifier, a step 34 will be performed or a first unique identifier (UID) to be assigned to the data entity. The value of the first DID can be numeric, alphabetic, or alphanumeric. The value of the first DID should be unique, that is to say the first DID is guaranteed to be unique among all identifiers assigned to each data entity of the first set of data entities.
    During the next step 35 becomes. a parent identifier assigned to each data entity 22 of the first set of data entities. The value of the mother identifier of the data entity 22 at data level "-Î" is equal to the value of the DID of the data entity at data level n. In the event that an input data entitcii has a data level of zero (0}, the assigned value of the master identifier assigned to those input data entries is DVT 1
    Referring to Figure 4 and according to a preferred embodiment of the invention, a step 41 will be performed to determine the first UID, the master identifier and the value of the M id after trawusidtnui ^ .uo »or source data element identifier assigned to each data entity 22 of the first set of data elements at le m a first data structure object 41 in memory. This structure object includes a first UID identification 42, one
    IS
    BE2017 / 5376 mi cco> kmttkan udenntkaae and «eu brondatacntitcitside.uidcatoridcniiin'artc 44.
    In accordance with a preferred embodiment of the invention, a responsive action 5 performs an action to determine a first set of data elements of the data source by enumerating the data p nsm with gchtmk N a parset He, \ w <tctU data elements comprises at least one data element 23. Each data element of the first series of data elements comprises a data value 27 and a data data element identifier 26. Starting with the series of data elements, the
    IO selgemk ν-ύΡΓ'.η mn-woesd vo; den «vor ebe do, · '« mn «n , ir -kc« la data elements: determination of the data value of an input data element, determination of the htondjtamknoenbicknmi!' son eu the emv.e U1D stored in. the data structure object in memory. For each data value identified according to the previous steps, a data type of the data value is determined from a list of data types. According to a preferred embodiment of the invention, this list of data types includes string, date format, integer, and. scientific notation data types (“float data types”). However, the type of data types is not limited to those separate from data types.
    According to a preferred embodiment of the invention, the data value of each data element of the first set of data elements is mapped according to its data type 46 on a first data value object 48 in the memory, the first data value object in the memory collecting a second collection of information that is, references to the UID 45 where the LID has been assigned according to action
    34, the data value of the data element being stored according to its data type and a reference to the owner 47 of the data source 11.
    : lesson -1 m lUiroNCi. 4Î Oi J Ιΐ, - · Ί ’. L VClJC 'CpgCsl: g : OCU d 0 0 storage.
    3f .......
    According to another embodiment of the invention, it digitizes owner, v <cc '-, -, ί ,, c' e ,. - o 'S3' p c «- 'ccci c Λ -.
    BE2017 / 5376 of an OCR. 13 so the data is exported in an 'XML fonnat. This data is sent to and received by means for processing 12 of the data source IL. The data source ii may, for example, comprise two data groups 24 because of the A dtgdalCxetA · d do m tue uedrikode klu'eu ixwat i n data group 24 is a subset within the data source 11 and oravat data entities. 22 23,
    The example below is similar to the example discussed above and includes 4 data groups 24 for three (3) different customers:
    <Xh: i V4XX ”'iff ÏUÜJ4g ~ XXX>
    <} D>
    <sample> John <. 'siifr; af:! e- n „. .- i. " λ. ’u s ne '<age> 4t waseo -,' Unii.» »Ht - chcr-tiP '' Sädd: ess>
    <'3 <kires. >>
    Rnerch. </ tw <π>
    <»Ç> wnew <ad« rsss>
    rfiurabes ·; - '43 rknifffbefO «eïiv» Matines ufeifva
    Oarîic! ·; - '·
    Ü> 1 <- · ι <·: '<price> 4 ί -'. / Pfii.iS '40! >
    V WW Ws «rriafneS« WW Mae wiiefiUIW t î I << 'cfieRtîô>
    s, e, '' '* <Rumoer> 42 </number>
    BE2017 / 5376 't.ïty> Maiines ί,' <artfde>
    <3 · « .: B2 ö / iiäv <price> t i 1 </price>
    </ mer «h>
    <H »<0wner>
    ssoi'n amsv 'Vom Wsarnaotev Sïsamgî - - Smiïiïimîe </name>
    <«Ags;> 42 Skinny»
    5 ÆcKeîiHB »: 1 11 McäteniiV». ·,> Tn r '
    - nidtes · '<street-> Puxacitity Street - / street.'. ivittb · r ' . u . tttKt '
    Maiines Mcit / »</. Tfidff.> S>
    <ffi.erefe <asticie>
    tût Mlds25 <price> 41 <7priee>
    .................................................. .................................................. .................................................. .................................................. .................................................. ................................
    '' '! ! O V </ artieleS "
    WieraSv </ID>
    -Sßwitsrs <suînamc> Jnhn Mriintame »<natne- = · Sraithiane </irasne>
    <age> 4i </age>
    , οοιιί'Ο v .eniiP • ί / οβεβ «atMresssisüvct; Smtthlane < .: Ariet>
    <i-uifibor '' ·! ί </ itutnbef>
    > C: t '! -io e- ''
    MätiiiresiS »
    BE2017 / 5376 <arîir.ie>
    vid »®3 <n <fe <price> 12 </ prk; e>
    <3 <aetieie>
    «.Fffiercfea <A
    The data marks 24 in this example start with the XML note <1D> ers eirtdigen with </ID> and include information about each client, The type of information contained in this
    - o w -, <'v ,, v 's. , 'e o.' oo ',, v raentiteitsider.iificator- (' source data entity identifier ') 25 value of the daîa' X * ΊΛ ·, - oo.o, o,>, i.e. the data value held within the '<notation> For example, the value' surname 'in' <sample> 'may refer to a sen's last name (' surname ') while' same 'may refer to' <name> ' after his name (“name”).
    The data entities and data elements also have a data level that helps to understand the tree structure of the data source and the relationship between the different data20 entities. The data entities'<owoer> ! , '<address>' sn '<nterch'>'have data level i (s).
    k d-iu-om'teuon "., .. nano-ego. called 'rar-vt' rao wosdra do: -doummra 23 and located at the lowest daianit eau s dot ud .wggeu doze dameiemcn.ten 23 do not include other data elements 23 at lower levels (i.e. higher than r) .
    -vi o u um t'fouur 5 v i '. i-, m oo d '' no '11 on <o', x o, N none data entity for data entity parsed starting at the root level, that is. , - -. <,. . , 0 ''<'s, 0., 0 0,, o oo b no kn; ''> · 'Θ ^' o bi'n. . ,.O. "M 1" has no parent data entity, that is, a data entity at a higher level than it belongs to. The bread data entity idotifieator 1D : tan the data entity '<ID>' and the value of the data level of its parent data enduality, which say white 'NULL', are stored in a data structure object bestasid 31
    BE2017 / 5376
    41. When this information is stored, the application assigns a first unique identifier (“unique identifier, U1D) 34 42 to the input. An example of the data structure object file is shown below:
    UID Mother ID Broudata entity identifier
    Nall ID
    Thereafter, the application determines the presence of dara entities on a data level 1. In this case, the application determines 4 <owner>',' MtddressW and '<merch>' on data level 1. So, when the data entity WownerW is stored in the data structure objeet file in memory, its Mother ID is the first unique identifier of dafa entity '-iD> ie 1. Therefore, the new input in the data structure object file looks like this:
    UID Mother id LWted.ua-ud. N .ent: iK, noi 1 Null ID 2 1 owner
    In the example of "<owner>", the application identifies 4 data entities on x. xtantveau 2.da ' χ eggwi -.wnmimc' '. -res v ’-.» v χ, η 'c · .' »
    None of these data entities have data entities at level 3. The most recently mentioned data entities are also called data elements 23 because they r <. he ' k «e ·. . an st. J i <dw -, - w · ' '< ,, we have' .v 1 '. The dst value of k <sutname>'DJohn', from '<name> : is'Smithlane', from '<age>' is '41 etc. The meaning of these data values can be derived from the value of the source data element identifier . The opsian of this data20 ei.'iU .n hw 1 ni 'nu-be-tooth « ' Wtet m d <xcl. A :: 1 ufivi
    DID Mother id Source data entities: elements identifier 1 Dull ID · '> 1 owner ->:3 2 surname
    BE2017 / 5376
    2 name
    Ε ~ · <Ji <V
    Ultimately, parsing the data source according to the steps as explained above results in d <following schematic representation of the data true tuu robj eetbestan d:
    ; = you MmukrlD round data entities / eieme 1 Null m! iJ 2 1 owner 3 2 surname 4 2 name 5 2 age 6 2 clientID 7 -5 address 8 7 street 9 7 number 10 1 City 11 1 merch 12 11 article ΐ 7 i 7 id ΐ ΛS <+ 12 price : 5 Nuit ID ! a 15 owner 7 .16 surname 18 16 mans ; sÿ 16 age 7 A 16 clientID 7 S 15 address 22 21 street 77 21 number 74. 21 City 25 I à mcrch 26 25 article 27 26 id 28 26 price 29 Null ID 30 29 owner 31 30 surname 'J' * « 30 name
    BE2017 / 5376
    33 30 age 34 30 clientID 35 29 address 36 35 street 37 35 number 38 35 City 39 29 raereh 40 39 article 41 40 id 42 40 price 43 40 id 44 40 price 45 Null ID 46 45 owner 47 46 surname 48 46 name 49 46 age 50 46 clientID 51 45 address 52 51 street 53 51 number 54 51 City 55 45 march. 56 55 " article .57 56 Id 58 56 prmc
    Thereafter, the application will perform an action 37 by parsing the data source again and determining the data values of the data elements based on the data structure object file 41 in the memory. The data values are stored in a data value object file 48 in memory according to the data type. In one nitAOeringsYom ran the envudmc, b s: 'm dansMns rwuemp'r using the “string” (sir), “integer” (“integer”) (int), and “date μλμι (“ daiuro notation ”) (date) data types. Reference is made to the IIID assigned to the dala-cntitcit / bet data element when saving the data value 34.
    For example, the value of the first data element that is encountered when parsing through the data source is "John". The value of the UID of this data value is "3". thus, a schematic representation of the data value object file will look like it.
    BE2017 / 5376
    Reference to DID Int Str Date GebmikerslD / John / A
    Reference to the owner (UserID (“userïD”)) of the data source is also made. This allows for a more efficient depiction of side-treated pekivroiu-ehe-wbu dirty.
    Owners know themselves prior to the generation of the data source or prior to the processing of the data in the database.
    Applying the same data value identification method to the other data
    elements remain in theobject 4S in memory: following schematically The display of the data value Transfer ij / mg to IdD Int Str Date UserID 3 John a 4 Smith! ane a 5 41 a 6 iii .A 8 Srnithlane a 9 43 a 10 Mali ne s a 13 101 a 14 41 a 17 Max B 18 Mad B 19 41 B 20 111 B J> Srnithlane B 23 42 B 24 Malines B 27 102 B 28 i i i B 31 Tom C 32 Srnithlane C 33 42 C 34 ni G
    BE2017 / 5376
    23 56 Piccadilly Street c d · ··} J 7 X, V. 3k Maiines C 41 101 c 42 41 c 43 102 c 44 111 c 47 lohn a 48 Smithlane a 46 41 a 50 111 a 52 Smhhlane a 53 41 a 54 Malines z 57 303 a 58 ·> a
    s. s. <. When the data value object file 48 is generated in memory, both files are stored in a data store 49 on the calculator. The processing of the data source according to the method as described above guarantees efficient storage of the data structure and data values.
    Rmeudien helps determine an anonymous source data identifier value for any arbitrary data value that enters the calculation input.
    According to a. certain embodiment of the invention, the method for determining a unique source data element identifier value for an input data value list further comprises executing an actis to map the value of the unique source data element identifier to an output object, the output object having at least one data value from the input value list.
    In a specific example, the following dat.ah.ron is obtained;
    <ID>
    <ITX 1> 42 </IDJ>
    <ID>
    BE2017 / 5376 <ID>
    <1DJ> 41 </lDJ> 01 D>
    The value of the source data element identifier 26 of data element <iD!>'Does not reveal anything about the meaning of the data values' 42 'and' 4P. These values can be ,,, s 1 '> -,. . - x, - preferred embodiment of the invention and referring to Fig. 5, a method is outbuid the value of the source data element.
    1Ö identify these failures and ora to map the value of the source data identifier value to an output object. According to an embodiment of the invention, an action 52 is carried out to determine first identical occurrences of the data values 42 and 41 in the existing detain, which is a data item, which is shown in 48 the data storage 49. The data values '42' and '41' can be displayed in a list of data values 51. This list of data values must contain at least two (2) data values. The data values can be of any data type stored in the data value object file 48.
    Referring back to the previous example of the data value object file, the ddtawanrdc M2 'is identified with reference to the following tllD values 45; "22" and "32". Based on this list of reference to DID 45, an action 53 is performed to link the data value '42' to one or more values of the source data element identifier 44. The value of the source data element identifier 26 can be retrieved nit bet daiastruetuurobjecibesiand o v x o. vo '' .a '.'Ίχ' χ ,, x '. ,, xSt · s o',. , · w. the source data element identifier values "number" and "age". An action 54 is performed to display the values of this identified source data element identifier in a first file in memory. in this example, the application will perform the same action for the data value ΜΓ identifying the following first unique identifier: "5", "14", "19", M2 "and" 53 ". Based on the reference to the DID, the application is able to
    BE2017 / 5376 to link these idetnifseators to the values of the source data identifier values 'age', 'price', 'age', price, 'number 1' which are stored in the data structunrobjeot file 41 in the data store 49, So, a unique source data element identifier source for data values 42. and 4 ί is 'age'.
    According to a preferred embodiment of the invention, an aerie will contain 56 mw'Occ -> ·>; > 'Bee' a, to n Joe. . .. -'a. ·., of the source data eicdientidemificator on the data values "42" there "41".
    The present invention discloses a coroputer-amplified method and apparatus 10 for processing structured data, preferably printed data and data received via patients or file transfer, and for generating standardized data files. In particular, this invention relates to the storage and identification of these data for document generation, preferably standardized output note, especially electronic receipts. The invention discloses a method of storing structured comprising the steps of storing the data structure and data values of the data source in a data storage, and determining a unique source data item identifier value for an input data value list. These, '0 v s'', C o, , "" v,,,, "- S" "do not identify a document or a general, or specific, undefined data stream without the requirement to manually create a source data directory". udeotsf caP'V's cade tve to be known nun vo techs nooetdersvaasdts for generating documents, in particular of standardized exports, in particular electronic receipts
    BE2017 / 5376
    权利要求:
    Claims (8)
    [1]
    Conclusions
    1. Computer-implemented method for processing structured data, where the structured data is included in a data source
    5 (11), the method comprising a first phase (60) for hm recording of the structured data comprising the successive steps of:
    a.Receiving (61) the data source (11) by means of data rejection means (12).
    b. determining (62) a daiasuuctur of the dam source tl 1) first
    10 array of source data entities using the means for> use ken m da 'i, i 3'
    e. imaging (63) the data structure on a first data structure object (41) in a memory, the first data structure object (41) a source data entity identifier value (44), a first unique
    15 includes identifier value (42) and a parent identifier value (43);
    d. determining (64) a data value (27), a data value type (46) and a brondaia element identity value 126) voox each data element (23) in a first series of data elements of the data source (11) using the means for processing data (12):
    20 e. displaying (65). the data value (27), the data value type (46) and the, 'm' e ce 'e, o v e' e 'in a memory;
    f. it, in one. data storage (49), storing (66) the first data structure object (41) in memory and the data value object (48) in memory.
    [2]
    The method of claim i, wherein step b. includes the consecutive steps for each data entity of the first set of data entities:
    b.l determining a data level «, where« is a positive whole equal to or greater than 0;
    B.2 determining the brondaia end identity identifier value (44): b.5 .c e 'vu of ae first u. e ^ e ne,
    BE2017 / 5376
    b.4 assigning the parent identifier value (43), the parent identifier value (43) being equal to a second unique identifier value of a data entry at a data level -1 -1, and further comprising assigning a NULL value to the parent identifier as
    5 the data level «is equal to zero.
    [3]
    The method according to claim 1 or 2, wherein step d. includes the following steps, the steps being preferably sequential, for each data element in the first set of dsta elements:
    d, 1 determining the data value (27);
    d.2 determining the source data element identifier value (26) and the first unique identifier (42) stored in the data streaming robot (41) in memory;
    d.3 determining the data value type of the data value (27),
    [4]
    4. Process for processing .m structured ·; · dm «according to one an '! ·; preceding claims, which includes a second phase for determining a unique data-rich hkmoic amdt, wherein the unique data dev Uwdw u.iceuv cg «D« 'W umc The second phase comprises the following, preferably consecutive, steps for each entry at which the e;
    g. defining (68) a report file In memory comprising the steps of.
    gl it, determining (681) a series of identical data values from the data value object (48) stored in the data store (49), the identical data value being the data value 146) equal to the input atawa ar de;
    g 2 the lx posts v'X > λ au a series of source data element illumination values from the data store (49), whereby the source data-k-eaxxde et al. '. k. >. e di mt slide structure object (41) using the first unique
    BE2017 / 5376 Identifier value (42, 45) of the idiotic data values set in slack g.l;
    g.3 storing (683) the set of fondata element identifier value a in the tappvrt file in memory,
    [5]
    5 h. determining (69) whether the unique data value sOftealOr value can be derived from the rappori file in memory, the unique data,. ·, ,,, ", e ·>", · "", - "is>, ·> ·». And twer bo -, 0 .. ί e ", utdes;
    i. repeating {70 from stag g. and step h. for the next input data value 10 in case the unique data element sideritificalcr value could not be derived in step h,
    The method of claim 4, further comprising a step j. After step i. om, 'oe eon,. , urn>., '' d, 'd, ν' '> m, ee,', e,
    15 wherein the onion feed object comprises at least one input data value.
    [6]
    A method for the generation of documents, in particular of standardized output data, in particular electronic receipts, according to any one of the preceding claims.
    2d
    [7]
    A computer-implemented device that facilitates data processing using the method of any one of claims 1 to 6, wherein data is contained in a data source, the device comprising:
    A. Means for obtaining the data source, the data source comprising data theories and daemia elements;
    b. means for determining a data structure of the data source;
    c. means for determining data values of the data source;
    d. means for storing a data structure object and a data value object in a data store; and
    e. cet on-id, t bet P, pol, n in eon nrnek, d u.n elements identifi ca toi u-1,> <vi at least one input data value
    BE2017 / 5376
    [8]
    8. Computer-readable medium containing corn-impumentable iostrucdcs which, xan.xxr dx 'ubg.woerd be <kxx a \ 3feeuwfernem bet systeentetement to carry out a method according to one of the
    5 claims 1 - 6.
    BE2017 / 5376
    BE2017 / 5376
    H
    XML cede : <ID> „---------------------------- j <sumame> John </sumame> ^
    Î <name> Smith </name> ♦ -, 23; <age> 38 </age> - - ·: A 'k s <! D> À / <surnawe> Alien </sname> ί <name> James </name> | </iD> *:
    <Kurci tlsla fiKy - / »„ no <, ite »-ί-,: ι> · -ρ | £ ί ·>
    isöu «dsts element ittei i3fief> ö9tawaa« dssc / si {S! fSS data »iscisn; idi <ü.ssf ^
    BE2017 / 5376
    Β ·
    BE2017 / 5376
    4S4S '«5 *' S $ ï · ÏWSSK & V $ Ä ä: & 3SSS::.
    ÄiVSiiSSK:
    w su «S :;.«: |
    BE2017 / 5376 '' ÜÎ'.4 '' -ii · '*>' S! »I'SSiSi!. ·! ! «ÎSUi ^ ¥ ·· 4.» Ä is N ./C '.!. > & -i! ÿ '5-îW'. <'ï' SS4S! $ '<4 iS. » SS! ! »! x '<»iiSiî! iWî iÿ-ïSô'« ί <Τ 'ϊΧ'ί .......... SSSSSW »/! //' / <<<
    BE2017 / 5376
    UH Oft & W »SHs
    1 '• X «5j: V-Sw-S ·· ^ S < A
    H'JSiH H
    Ί '
    Y '<$ S * <H ·> ❖'X' · 'S .sssssssssssssssssss . .χ'ψ ^ gj £ .WVVlWtM '.'. '. VVVVVVVV'.V.'. '.'. '. W »SSW SSS XSSSSS * Ä' K \ ί X
    WW -. ^ X ·· - - ^. ' s « v.' • s'y S ': <. .. <0'S. . WwA: ·. ·· ίΧ ·> Λ · »Χ«: $ -ïX <-X: X-xug <-y ·.
    œ.
    DUHSHSU
    2017/5376
    类似技术:
    公开号 | 公开日 | 专利标题
    Gupta et al.2019|Deep learning in image cytometry: a review
    Singh et al.2012|A survey of OCR applications
    JP6402265B2|2018-10-10|Method, computer device and storage device for building a decision model
    CN110188198B|2021-06-22|Anti-fraud method and device based on knowledge graph
    WO2019157025A1|2019-08-15|System and method for generating an electronic template corresponding to an image of an evidence
    JP2005352997A|2005-12-22|Construction method of case database, learning method of distinguishing device, data distinguishing support device, data distinguishing support program
    WO2021164382A1|2021-08-26|Method and apparatus for performing feature processing for user classification model
    AU2021218110A1|2021-09-09|Learning from distributed data
    WO2020172088A1|2020-08-27|Micro-loan system
    CN110046249A|2019-07-23|Training method, classification method, system, equipment and the storage medium of capsule network
    Biau et al.2020|Some theoretical properties of GANs
    CN111899259A|2020-11-06|Prostate cancer tissue microarray classification method based on convolutional neural network
    Grechikhin et al.2019|User modeling on mobile device based on facial clustering and object detection in photos and videos
    WO2020186887A1|2020-09-24|Target detection method, device and apparatus for continuous small sample images
    Quirin et al.2010|Graph-based data mining: A new tool for the analysis and comparison of scientific domains represented as scientograms
    JP2020053073A|2020-04-02|Learning method, learning system, and learning program
    BE1024445B1|2018-02-27|Method and device for processing structured data and generating standardized output data
    CN110751285A|2020-02-04|Training method and system and prediction method and system of neural network model
    Li et al.2019|Patch transformer for multi-tagging whole slide histopathology images
    CN108897754A|2018-11-27|Recognition methods, system and the calculating equipment of work order type based on big data
    US20210150338A1|2021-05-20|Identification of fields in documents with neural networks without templates
    Juarez2016|The dual aspects of accounting transaction and the assets-claims on assets equality in axiomatic theory
    CN111428725A|2020-07-17|Data structuring processing method and device and electronic equipment
    CN110956166A|2020-04-03|Bill marking method and device
    Varghese et al.2020|INFOPLANT: Plant Recognition using Convolutional Neural Networks
    同族专利:
    公开号 | 公开日
    BE1024445A1|2018-02-21|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    法律状态:
    2018-03-14| FG| Patent granted|Effective date: 20180227 |
    2019-07-17| HC| Change of name of the owners|Owner name: RYDOO NV; BE Free format text: DETAILS ASSIGNMENT: CHANGE OF OWNER(S), CHANGEMENT DE NOM DU PROPRIETAIRE; FORMER OWNER NAME: XPENDITURE NV Effective date: 20190618 |
    优先权:
    申请号 | 申请日 | 专利标题
    EP16171581.8|2016-05-26|
    EP16171581|2016-05-26|
    [返回顶部]