Virtual aggregate fields

Details Virtual aggregate fields Virtual aggregate fields

2000-08-29

2004-02-17

Alam, Shahid Al (Department: 2172)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000, C709S223000, C715S252000, C715S252000

Reexamination Certificate

active

06694338

ABSTRACT:

FIELD OF INVENTION
The invention is related to the field of representation and translation of electronic documents.
BACKGROUND OF THE INVENTION
Some documents have fields that must be combined or massaged to produce data that matches a desired “meaning”. For example, in a document, the following structure may be present in Document
1
:
Store_Identifier (group)
DUNS_Number (9-digit field)
Store_Number (4-digit field)
And in Document
2
:
Location (11-digit field)
Where the Location is the DUNS_Number with the Store_Number concatenated to it. In this case, a “meaning” is part of multiple fields in Document
1
.
Conventional solutions to mapping require users to write customized code to handle such cases. For example, suppose Vendor
1
has a mapping tool that Customer
1
uses. Customer
1
is mapping Document
1
to Document
2
. Customer
1
writes code like:
Target.Location=concat(Source.Store_Identifier.DUNS_Number, Source.Store_Identifier.Store_Number)
Locations in a document can have more than one meaning. This means that mapping is hard to automate. Instead, the mappings must be manually done and require customized code, which does not allow reuse of mapping knowledge and rules.
Conventional solutions have several disadvantages. First, both mapping and the mapping rules are one-off. That is, each time a user wants to define how to perform a document translation, similar code must be written and tested. This increases the time needed to define how to translate from the source to the target document.
Furthermore, both mapping and the mapping rules depend on user-written code. This makes it hard to automatically validate the integrity of the mapping. It also sets a minimum bar for the skill level of anyone trying to define a mapping, as they must then know all the document locations that might hold a particular meaning, and must be skillful enough to write the code to handle the case. This imposes a maintenance burden, as fixing a problem in a mapping requires altering code.
The mapping and the mapping rules are translation-language dependent. The code that must be written and tested depends on the underlying translation engine that will translate the documents. Thus, mapping rules will be translation-engine dependent, and that a translation defined for one translation engine will likely need adjusting to make the mapping work on a different translation engine. Moving a transform from one translation engine to another is difficult.
The source and target mappings must be significantly different. The code for handling the case described above will differ whether the document is the source or the target document. If one has mapped from A to B, mapping from B to A requires major rework, as the code for the mapping would have to be re-written using different logic.
Conventional mapping tools previously use superficial similarities in field names or document structure as the basis for automapping. They can not automap to virtual structures, forcing users to write code.
SUMMARY OF THE INVENTION
A method comprising defining one or more aggregate virtual fields for a first document using meta-data associated with the first document is disclosed.


REFERENCES:
patent: 5119465 (1992-06-01), Jack et al.
patent: 5173853 (1992-12-01), Kelly et al.
patent: 5272628 (1993-12-01), Koss
patent: 5276793 (1994-01-01), Borgendale et al.
patent: 5367619 (1994-11-01), Dipaolo et al.
patent: 5369761 (1994-11-01), Conley et al.
patent: 5428776 (1995-06-01), Rothfield
patent: 5442778 (1995-08-01), Pedersen et al.
patent: 5584024 (1996-12-01), Shwartz
patent: 5627979 (1997-05-01), Chang et al.
patent: 5657440 (1997-08-01), Micka et al.
patent: 5724573 (1998-03-01), Agrawal et al.
patent: 5946688 (1999-08-01), Roberts
patent: 5960435 (1999-09-01), Rathmann et al.
patent: 6009429 (1999-12-01), Greer et al.
patent: 6014680 (2000-01-01), Sato et al.
patent: 6067552 (2000-05-01), Yu
patent: 6085196 (2000-07-01), Motoyama et al.
patent: 6128627 (2000-10-01), Mattis et al.
patent: 6202072 (2001-03-01), Kuwahara
patent: 6209003 (2001-03-01), Mattis et al.
patent: 6282544 (2001-08-01), Tse et al.
patent: 6311173 (2001-10-01), Levin et al.
patent: 6327594 (2001-12-01), Van Huben et al.
patent: 6434568 (2002-08-01), Bowman-Amuah
patent: 6453319 (2002-09-01), Mattis et al.
patent: 6484177 (2002-11-01), Van Huben et al.
patent: 6499041 (2002-12-01), Breslau et al.
patent: 6529909 (2003-03-01), Bowman-Amuah
patent: 6546381 (2003-04-01), Subramanian et al.
patent: 2002/0010714 (2002-01-01), Hetherington
Kotsakis et al., “XML Schema Directory: A Data Structure for XML Data Processing,” Proceedings of the First International Conference on Web Information Systems Engineering, vol. 1, pp. 62-66, Jun. 2000.

Affiliated with

Also associated with

Rating

Virtual aggregate fields does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Virtual aggregate fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Virtual aggregate fields will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3292175