Source: http://www.google.com/patents/US8041746?dq=U.S.+patent+number+7,325,728
Timestamp: 2016-10-26 14:36:25
Document Index: 350972954

Matched Legal Cases: ['art 5', 'art 1', 'art 2', 'art 4', 'art 5', 'art 5', 'art 1', 'art 2', 'art 4', 'art 5', 'art 8', 'art 8']

Patent US8041746 - Mapping schemas using a naming rule - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsAmong other disclosed subject matter, a computer-implemented method for creating a mapping includes obtaining a definition relating to a first schema, the definition comprising a first plurality of nodes to be mapped to a second schema comprising a second plurality of nodes. The method includes receiving...http://www.google.com/patents/US8041746?utm_source=gb-gplus-sharePatent US8041746 - Mapping schemas using a naming ruleAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS8041746 B2Publication typeGrantApplication numberUS 11/981,454Publication dateOct 18, 2011Filing dateOct 30, 2007Priority dateOct 30, 2007Fee statusPaidAlso published asUS20090112916Publication number11981454, 981454, US 8041746 B2, US 8041746B2, US-B2-8041746, US8041746 B2, US8041746B2InventorsGunther StuhecOriginal AssigneeSap AgExport CitationBiBTeX, EndNote, RefManPatent Citations (16), Non-Patent Citations (51), Referenced by (17), Classifications (12), Legal Events (3) External Links: USPTO, USPTO Assignment, EspacenetMapping schemas using a naming rule
US 8041746 B2Abstract
1. A computer-implemented method for mapping a first schema to a second schema, the method comprising:
identifying a first schema that includes a plurality of first data element definitions, each of the first data element definitions defining a semantic of a data portion in first electronic documents that are generated according to a format of the first schema, wherein each of the first data element definitions in the first schema is uniquely identified by a respective first name;
receiving an indication that the first schema is to be mapped to a second schema, the first and second schemas being different from each other such that a computer system configured according to the second schema is unable to semantically interpret the first electronic documents,
wherein a naming rule specifies a process to generate a name for a data element from a human-understandable description for the data element by performing linguistic analysis on the human-understandable description for the data element,
wherein each of multiple second data element definitions in the second schema is uniquely identified by a respective second name generated using the naming rule,
wherein the first names that identify the first data element definitions in the first schema are not generated using the naming rule;
generating a new name for each of the first data element definitions from the human-understandable description for each of the first data element definitions by applying the process that is specified by the naming rule to the human-understandable description for each of the first data element definitions, wherein the second names and the new names are defined by Core Components Technical Specification (CCTS) standard, and wherein the first names are not defined by the CCTS standard; and
mapping at least one of the first data element definitions in the first schema to a corresponding one of the second data element definitions in the second schema based on the new name for the one of the first data element definitions in the first schema matching the second name of the one of the second data element definition in the second schema.
2. The method of claim 1, wherein the new name of the first data element definition matches the second name of the second data element definition by being a same name as the second name.
determining that none of the second names are same as a particular new name of a particular first data element definition; and in response:
(i) adding a new data element definition to the second schema, a name of the new data element definition being same as the particular new name, and
(ii) mapping the particular first data element definition to the new data element definition.
4. The method of claim 1, wherein the second name for each second data element definition is unique among all second names of second data element definitions in the second schema.
5. The method of claim 1, wherein each first data element definition is associated with a context value that is in the first schema, wherein each second data element definition is associated with a context value that is in the second schema, and wherein the mapping is further based on the context value for the first data element definition matching the context value for the second data element definition.
6. The method of claim 1, wherein generating the new name for each first data element definition comprises transforming the first schema into a transformed schema, wherein the transformed schema includes, for each first data element definition in the first schema, a corresponding transformed data element definition that is uniquely identified by the new name for the corresponding first data element definition, and wherein each transformed data element definition identifies a first name of the corresponding first data element definition.
7. The method of claim 1, wherein generating the new name for each first data element definition comprises:
receiving a human-understandable description of a specific first data element definition for which a new name is to be created, the new name complying with a predefined name format that is same as a predefined name format of the second names;
identifying a noun phrase and a verb phrase in the human-understandable description; and
generating the new name using a first noun obtained from the noun phrase and a second noun obtained from the verb phrase.
8. The method of claim 7, wherein identifying the noun phrase and the verb phrase includes generating a hierarchical tree for the human-understandable description.
9. The method of claim 7, wherein the predefined name format requires the new name to comprise at least a first term for an object class to which the specific first data element definition relates, and wherein the second noun is used as the first term.
10. The method of claim 9, wherein the predefined name format requires the new name to comprise also a second term for a property of the object class, and wherein another noun associated with the verb phrase is used as the second term.
11. The method of claim 10, wherein the predefined name format requires the new name to comprise also a third term for a representation form of the specific first data element definition, and wherein the first noun is used as the third term.
presenting the mapping of the at least one of the first data element definitions in the first schema to the corresponding one of the second data element definitions in the second schema to a user as a suggestion which the user can at least accept or reject; and
receiving user input that the user accepts the presented mapping;
wherein the mapping of the at least one of the first data element definitions in the first schema to the corresponding one of the second data element definitions in the second schema is performed in response to receiving the user input.
13. A computer program product tangibly embodied in a non-transitory computer-readable storage medium and comprising instructions that when executed by a processor perform a method for creating a mapping, the method comprising:
15. The computer program product of claim 13, wherein the second name for each second data element definition is unique among all second names of second data element definitions in the second schema.
16. The computer program product of claim 13, wherein generating the new name for each first data element definition comprises transforming the first schema into a transformed schema, wherein the transformed schema includes, for each first data element definition in the first schema, a corresponding transformed data element definition that is uniquely identified by the new name for the corresponding first data element definition, and wherein each transformed data element definition identifies a first name of the corresponding first data element definition.
17. The computer program product of claim 13, wherein generating the new name for each first data element definition comprises:
a non-transitory computer-readable storage medium comprising instructions;
one or more processors configured to execute the instructions to perform operations comprising:
21. The system of claim 19, wherein the second name for each second data element definition is unique among all second names of second data element definitions in the second schema.
22. The system of claim 19, wherein generating the new name for each first data element definition comprises transforming the first schema into a transformed schema, wherein the transformed schema includes, for each first data element definition in the first schema, a corresponding transformed data element definition that is uniquely identified by the new name for the corresponding first data element definition, and wherein each transformed data element definition identifies a first name of the corresponding first data element definition.
23. The system of claim 19, wherein generating the new name for each first data element definition comprises:
The material on the accompanying compact discs is hereby incorporated by reference into this application. The accompanying compact discs contain one file, Computer Program Listing, which was created on Sep. 9, 2011. The file named Computer Program Listing is 140 kb. The file can be accessed using Microsoft Word on a computer that uses Windows OS.
From the first schema 20 to the second schema 30 From the first schema 20 to the intermediary schema 40 From the second schema 30 to the first schema 20 From the second schema 30 to the intermediary schema 40 From the intermediary schema 40 to first the schema 20 From the intermediary schema 40 to the second schema 30 Such conversion rules can convert instances that are based on the first schema, the second schema and also the intermediary schema at runtime. In other implementations, other conversion rules can be used.
In=(MA) and Bu=(OR), where MA represents manufacturing and OR represents order processing.
In=(*), Bu=(OR), where “*” is a wildcard character. A second node that is a matching candidate includes the context
In=(MA), Bu=(OR,IN), where IN represents invoice processing. Finally, in this example, a third node that is a matching candidates includes the context
In=(MA,AU), Bu=(OR), where AU represents the automotive industry. Based on weights of the context categories, the context matcher 404 b may assign the highest probability to the second matching candidate because the wildcard character in node 1 relates to a bigger set than a single value, and the category In has a higher weight than the category Bu.
Matcher Component
Structure/Level Path
syntaxVersion
unitBusinessCategory
idOrganizationalUnit
businessDocument
dictionaryEntryName
DEN Matching/
Code and Qualifier
A=a holds, or when
A=“INOUT”,a=“IN”
A=“IN”,a=“INOUT”,
T DSA ={iε[1, . . . , m]|T i >T min ^T i =T max}
Geopolitical = “USA”
Buyer. Address
Geopolitical = “Germany”
< . . . excludedIndicator=true allContextValuesIndicator=true>
</. . . >
Syntax notation according
conventions of comma
TRADACOMMS
Other syntax representation that
XML - complexType
The representation of complex type
EDIFACT -
The representation of an element group
that includes further element groups
and/or leaf elements that includes
Segment Loop
EDIFACT - Data element
The representation of an leaf element
containing content.
The representation of an attribute that
XML - simpleType
The representation of a base or
EDIFACT - Segment
EDIFACT - Message
The name is only shown at the beginning of
The name is shown at the end of the
Start Tag and
The name is shown at both positions,
at the beginning and the end of
The name is not shown in the instance.
xsd:built-in type
xsd:string (+pattern=“[A-Z]”*)
StartPreSign
Pre Sign of
Defines the sign before a start tag, which is defined by
the attribute @typeCode in element ArtefactName
StartPostSign
Post Sign of
Defines the sign after a start tag, which is defined by the
attribute @typeCode in element ArtefactName
EndPreSign
Defines the sign before an end tag, which is defined by
EndPostSign
Defines the sign after an end tag, which is defined by the
No normalization (changing) of the content
All occurrences of tab (#x9), line feed (#xA), and
Additional to replace, contiguous sequences
Inclusive upper bound of the content component, which
limits the content to less than or equal to the defined
maxExlusive
Exclusive upper bound of the content component, which
limits the content to less than the defined maxExclusive
Inclusive lower bound of the content component, which
limits the content to greater than or equal to the defined
Exclusive lower bound of the content component, which
limits the content to greater than the defined minExclusive
The content should be left aligned (e.g.,
The content should be right aligned
The context should be represented in the
middle of the fixed content length
Definition of a constraint in freeform text or by a human
Definition of a constraint according to a similar
technology as the formal constraint language Object
Definition of a constraint according to the XML
Stylesheet Language Transformation (XSLT)
Source Processing in both directions, which are from instance
based on source schema into instance based on
Processing from instance based on source schema
into instance based on CCTS schema.
CCTS →
Processing from instance based on CCTS schema
into instance based on source schema.
[�] is used to represent a plus sign [+] if in combination with the following element a positive value or zero needs to be represented (in this case, unless explicitly stated otherwise, the plus sign shall not be omitted), or a minus sign [−] if in combination with the following element a negative value needs to be represented.
M=Minute, S=Second. YYDDD can be used to represent a calendar day (e.g., 1 Jan. 2007 can be represented as 07001). For example, MMDD can be used to represent a day of a month. For example, DDD can be used to represent a day's number within a specific year. For example, WW can be used to represent a week's number within a specific year. MM can be used to represent a month's number within a specific year. DD can be used to represent a day's number within is a specific month. YYMMDDHHMM can be used to represent a calendar date including time without seconds. To specify a time zone to represent the calendar date, YYMMDDHHMMZZZ can be used, where Z=Time zone. YYMMDDHHMMSS can be used to represent a calendar date including time with seconds. To specify a time zone to represent the calendar date, YYMMDDHHMMSSZZZ can be used, where Z=Time zone. CCYYMMDDHHMM can be used to represent a calendar date including time with minutes. To specify a time zone to represent the calendar date, CCYYMMDDHHMMZZZ can be used, where Z=Time zone. CCYYMMDDHHMMSS can be used to represent a calendar date including time with seconds. To specify a time zone to represent the calendar date, CCYYMMDDHHMMSSZZZ can be used, where Z=Time zone. CCYYMMDDHHMMZHHMM can be used to represent a calendar date including time and time zone expressed in hours and minutes. For example, ZHHMM can be used to represent a time zone given as offset from UTC.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS6560608Jun 9, 2000May 6, 2003Contivo, Inc.Method and apparatus for automatically selecting a ruleUS6662237Jun 24, 1999Dec 9, 2003Contivo, Inc.System for documenting application interfaces and their mapping relationshipUS6694338Aug 29, 2000Feb 17, 2004Contivo, Inc.Virtual aggregate fieldsUS6757739 *Jun 5, 2000Jun 29, 2004Contivo, Inc.Method and apparatus for automatically converting the format of an electronic messageUS20020095395 *Dec 6, 2001Jul 18, 2002Larson Jeffrey S.System and method of discovering informationUS20040083199 *Aug 5, 2003Apr 29, 2004Govindugari Diwakar R.Method and architecture for data transformation, normalization, profiling, cleansing and validationUS20050033768 *Aug 8, 2003Feb 10, 2005Sayers Craig P.Method and apparatus for identifying an object using an object description languageUS20050257193 *May 13, 2004Nov 17, 2005Alexander FalkMethod and system for visual data mapping and code generation to support data integrationUS20050278139May 28, 2004Dec 15, 2005Glaenzer Helmut KAutomatic match tuningUS20060218158 *Mar 23, 2005Sep 28, 2006Gunther StuhecTranslation of information between schemasUS20070150495 *Dec 21, 2006Jun 28, 2007Atsuko KoizumiProgram for mapping of data schemaUS20070168381 *Jan 18, 2006Jul 19, 2007International Business Machines CorporationSequential composition of schema mappingsUS20070179776 *Jan 27, 2006Aug 2, 2007Xerox CorporationLinguistic user interfaceUS20070203922 *Feb 28, 2006Aug 30, 2007Thomas Susan MSchema mapping and data transformation on the basis of layout and contentUS20070239435Apr 7, 2006Oct 11, 2007Gunther StuhecGenerating a unique name for a data elementUS20080306984 *Jun 8, 2007Dec 11, 2008Friedlander Robert RSystem and method for semantic normalization of source for metadata integration with etl processing layer of complex data across multiple data sources particularly for clinical research and applicable to other domains* Cited by examinerNon-Patent CitationsReference1"Adobe LiveCycle Designer FAQ" Adobe Systems Incorporated, document undated, 3 pages.2"Driving Automated Integration Today" [online]. Contivo [retrieved on Oct. 17, 2006]. Retrieved from the internet .3"Final Committee Draft ISO/IEC FCD-Information technology-Metadata registries (MDR)-Part 5: Naming and identification principles" ISO/IEC, document dated Jan. 8, 2004, 26 pages.4"Information technology-Metadata Registries (MDR)-Part 1: Framework" International Standard ISO/IEC 11179-1; Sep. 15, 2004; (32 pages).5"Information technology-Metadata Registries (MDR)-Part 2: Classification"; International Standard ISO/IEC 11179-2; Nov. 15, 2005 (16 pages).6"Information technology-Metadata registries (MDR)-Part 4: Formulation of data definitions," ISO/IEC, document dated Jul. 15, 2004, 16 pages.7"Information technology-Specification and standardization of data elements-Part 5: Naming and identification principles for data elements," ISO/IEC, document dated Dec. 1, 1995, 20 pages.8"Driving Automated Integration Today" [online]. Contivo [retrieved on Oct. 17, 2006]. Retrieved from the internet <URL: http://web.archive.org/web/20061017222738/http:/www.contivo.com/index.html>.9"Final Committee Draft ISO/IEC FCD—Information technology—Metadata registries (MDR)—Part 5: Naming and identification principles" ISO/IEC, document dated Jan. 8, 2004, 26 pages.10"Information technology—Metadata Registries (MDR)—Part 1: Framework" International Standard ISO/IEC 11179-1; Sep. 15, 2004; (32 pages).11"Information technology—Metadata Registries (MDR)—Part 2: Classification"; International Standard ISO/IEC 11179-2; Nov. 15, 2005 (16 pages).12"Information technology—Metadata registries (MDR)—Part 4: Formulation of data definitions," ISO/IEC, document dated Jul. 15, 2004, 16 pages.13"Information technology—Specification and standardization of data elements—Part 5: Naming and identification principles for data elements," ISO/IEC, document dated Dec. 1, 1995, 20 pages.14AnHai Doan, Jayant Madhaven, Pedro Domingos, and Alon Halevy, "Learning to Map between Ontologies on the Semantic Web," May 2002, Proceedings of the 11th International World Wide Web Conference, pp. 662-673.15 *C. Scroth, CCTS-based Business Information Modelling for Increasing Cross -Organization Interoperability, Aug. 29, 2007,Springer London, 467-478.16Core Components Technical Specification V2.01-Part 8 of the ebXML Framework, United Nations Centre for Trade Facilitation and Electronic Business, pp. 1-113, Nov. 15, 2003.17Core Components Technical Specification V2.01—Part 8 of the ebXML Framework, United Nations Centre for Trade Facilitation and Electronic Business, pp. 1-113, Nov. 15, 2003.18Davis, J., Context Tailor: Towards a Programming Model for Context-Aware Computing, International Middleware Conference Workshop Proceedings-Middleware for Pervasive and Ad Hoc Computing, Jun. 16-20, 2003, Rio de Janeiro, Brazil, 68-75, 2003.19Davis, J., Context Tailor: Towards a Programming Model for Context-Aware Computing, International Middleware Conference Workshop Proceedings—Middleware for Pervasive and Ad Hoc Computing, Jun. 16-20, 2003, Rio de Janeiro, Brazil, 68-75, 2003.20 *Erhard Rahm, Philip A. Bernstein, A survey of approcahes to automatic schema matching, Feb. 5, 2001, Springer-Verlag, The VDLB Journal 10.21GEFEG EDIFIX, "EDIFIX Functions," [online], Xenos, 2002 [retrieved on Nov. 30, 2005]. .22GEFEG EDIFIX, "EDIFIX Functions," [online], Xenos, 2002 [retrieved on Nov. 30, 2005]. <URL: http://www.gefeg.com/en/edifix/fx—functions.htm>.23GoXML Registry [online], Xenos, 2002 [retrieved on Mar. 23, 2005]. Retrieved from the Internet: .24GoXML Registry [online], Xenos, 2002 [retrieved on Mar. 23, 2005]. Retrieved from the Internet: <URL: http://www.xmlglobal.com/solutions/prod—goxml—registry.asp>.25Goyal, "An XML Schema Naming Assister for Elements and Types," National Institute of Standards and Technology, document obtained at http://www.mel.nist.gov/msidlibrary/doc/NISTIR7143.pdf on Jun. 24, 2005, 11 pages.26Hong Su, Harumi, Kuno, and Elke A. Rundensteiner, "Automating the Transformation of XML Documents," 2001, The ACM Digital Library, pp. 68-75.27Hong-Hai Do and Erhard Rahm, "COMA-A system for flexible combination of schema matching approaches," Aug. 2002, Proc. 28th Intl. Conference on Very Large Databases (VLDB), Hongkong, pp. 1-12.28Hong-Hai Do and Erhard Rahm, "COMA—A system for flexible combination of schema matching approaches," Aug. 2002, Proc. 28th Intl. Conference on Very Large Databases (VLDB), Hongkong, pp. 1-12.29Hong-Hai Do, Sergey Melnik, and Erhard Rahm, "Comparison of Schema Matching Evaluations," Oct. 2002, Proc. GI-Workshop "Web and Databases", Erfurt, pp. 1-15.30http://ww.notes.queensu.ca/uisadmin.nsf/579a5e3cc0e046c085256833007715cc/$FILE/queries-guide.pdf-BI/Query Queries Guide Hummingbird, Ltd., obtained from the Internet on Jul. 18, 2005, 6 pages.31http://ww.notes.queensu.ca/uisadmin.nsf/579a5e3cc0e046c085256833007715cc/$FILE/queries—guide.pdf—BI/Query Queries Guide Hummingbird, Ltd., obtained from the Internet on Jul. 18, 2005, 6 pages.32http://www.flexisoftsolutions.com/Products/SM2004/SM2004.aspx-FlexiSoft Solutions, obtained from the Internet on Jun. 24, 2005, 4 pages.33http://www.flexisoftsolutions.com/Products/SM2004/SM2004.aspx—FlexiSoft Solutions, obtained from the Internet on Jun. 24, 2005, 4 pages.34InfoPath 2003 Product Overview, Microsoft Office Online, Obtained from the Internet at http://www.microsoft.com/office/infopath/prodinfo/overview.mspx, on Jan. 4, 2005.35Jayant Madhavan, Philip A. Bernstein, and Erhard Rahm, "Generic Schema Matching with Cupid," 2001, Proceedings of the 27th VLDB Conference, pp. 49-58.36Jayant Madhaven, Philip A. Bernstein, and Erhard Rahm, "Generic Schema Matching with Cupid," Aug. 2001, Microsoft Research, MSR-TR-2001-58, pp. 1-15.37L. M. Haas, R. J. Miller, B. Niswonger, M. Tork Roth, P. M. Schwarz, and E. L. Wimmers, "Transforming Heterogeneous Data with Database Middleware: Beyond Integration," Copyright 1997, Computer Society Technical Committee on Data Engineering, pp. 1-6.38Lucian Popa, Yannis Velegrakis, Renee J. Miller, Mauricio A. Hernandez, Ronald Fagin, "Translating Web Data," 2002, Proceedings of the 28th VLDB Conference, pp. 1-12.39Oasis ebXML Registry TC[online], Oasis, 2005 [retrieved on Mar. 23, 2005]. Retrieved from the Internet: .40Oasis ebXML Registry TC[online], Oasis, 2005 [retrieved on Mar. 23, 2005]. Retrieved from the Internet: <URL: http://vvww.oasis-open.org/committees/tc—home.php?wg—abbrev=regrep>.41Project: ebXML Registry/Repository: Summary [online], SourceForge.net, 2005 [retrieved on Mar. 23, 2005]. Retrieved from the Internet: .42Project: ebXML Registry/Repository: Summary [online], SourceForge.net, 2005 [retrieved on Mar. 23, 2005]. Retrieved from the Internet: <URL: http://sourceforge.net/projects/ebsmlrr >.43Sergey Melnik, Hector Garcia-Molina, and Erhard Rahm, "Similarity Flooding: A Versatile Graph Matching Algorithm and its Application to Schema Matching," 2002, Proc. 18th Int'l Conf. on Data Engineering (ICDE), pp. 1-12.44The Company of The Open Standard Solutions [online], ebXMLsoft Inc., 2001-2004 [retrieved on Mar. 23, 2005]. Retrieved from the Internet: .45The Company of The Open Standard Solutions [online], ebXMLsoft Inc., 2001-2004 [retrieved on Mar. 23, 2005]. Retrieved from the Internet: <URL: http://www.ebsmlsoft.com/ >.46XForms 1.1, W3C Working Draft Nov. 15, 2004, Obtained from the Internet at http://www.w3.org/TR/2004/WD-xforms11-20041115, on Dec. 6, 2004, 26 pages.47XForms-The Next Generation of Web Forms, W3C, obtained from the Internet at http://vvww.w3.org/MarkUp/Forms, on Jan. 3, 2005, 11 pages.48XForms—The Next Generation of Web Forms, W3C, obtained from the Internet at http://vvww.w3.org/MarkUp/Forms, on Jan. 3, 2005, 11 pages.49XML Path Language (XPath) Version 1.0-W3C Recommendation Nov. 16, 1999, W3C, Obtained from the Internet at http://www.w3.org/TR/xpath, on Jan. 3, 2005, 37 pages.50XML Path Language (XPath) Version 1.0—W3C Recommendation Nov. 16, 1999, W3C, Obtained from the Internet at http://www.w3.org/TR/xpath, on Jan. 3, 2005, 37 pages.51XML Schema, W3C, Obtained from the Internet http://www.w3.org/XML/Schema on Jan. 3, 2005, 16 pages.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS8539001Aug 20, 2012Sep 17, 2013International Business Machines CorporationDetermining the value of an association between ontologiesUS8576097 *Jul 6, 2011Nov 5, 2013Nokia CorporationCoding using a mapping between a syntax element and a code wordUS8612469 *Apr 26, 2010Dec 17, 2013Globalenglish CorporationNetwork-accessible collaborative annotation toolUS8747115Mar 28, 2012Jun 10, 2014International Business Machines CorporationBuilding an ontology by transforming complex triplesUS8793208Oct 29, 2010Jul 29, 2014International Business Machines CorporationIdentifying common data objects representing solutions to a problem in different disciplinesUS8799330Aug 2, 2013Aug 5, 2014International Business Machines CorporationDetermining the value of an association between ontologiesUS8903891 *Jun 24, 2010Dec 2, 2014Sap SeUser interface communication utilizing service request identification to manage service requestsUS9053180Jun 11, 2014Jun 9, 2015International Business Machines CorporationIdentifying common data objects representing solutions to a problem in different disciplinesUS9229923Jun 27, 2012Jan 5, 2016Technologies Xpertdoc Inc.Method and system for producing documentsUS9298817Apr 25, 2014Mar 29, 2016International Business Machines CorporationBuilding an ontology by transforming complex triplesUS9311429Jul 23, 2013Apr 12, 2016Sap SeCanonical data model for iterative effort reduction in business-to-business schema integrationUS20110113320 *May 12, 2011Globalenglish CorporationNetwork-Accessible Collaborative Annotation ToolUS20110153539 *Oct 29, 2010Jun 23, 2011International Business Machines CorporationIdentifying common data objects representing solutions to a problem in different disciplinesUS20110320521 *Dec 29, 2011Sap AgUser Interface CommunicationUS20120169519 *Jul 6, 2011Jul 5, 2012Nokia CorporationMethod for coding and an apparatusUS20120185517 *Dec 14, 2011Jul 19, 2012Infosys Technologies, Ltd.Method and system for converting ubl process diagrams to owlUS20130275448 *Feb 26, 2013Oct 17, 2013Board Of Regents, The University Of Texas SystemMethod and system for ontology driven data collection and processing* Cited by examinerClassifications U.S. Classification707/802, 715/234International ClassificationG06F17/30, G06F17/20Cooperative ClassificationG06F17/2247, G06Q10/10, G06Q30/06, G06F17/227European ClassificationG06F17/22M, G06F17/22T2, G06Q10/10, G06Q30/06Legal EventsDateCodeEventDescriptionJan 23, 2008ASAssignmentOwner name: SAP AG, GERMANYFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:STUHEC, GUNTHER;REEL/FRAME:020401/0159Effective date: 20080121Aug 26, 2014ASAssignmentOwner name: SAP SE, GERMANYFree format text: CHANGE OF NAME;ASSIGNOR:SAP AG;REEL/FRAME:033625/0334Effective date: 20140707Mar 25, 2015FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services