WO2010118931A1 - Verfahren und vorrichtung zum generieren einer rdf-datenbank für eine rdf-datenbankabfrage, sowie ein suchverfahren und eine suchvorrichtung zur rdf-datenbankabfrage - Google Patents
Verfahren und vorrichtung zum generieren einer rdf-datenbank für eine rdf-datenbankabfrage, sowie ein suchverfahren und eine suchvorrichtung zur rdf-datenbankabfrage Download PDFInfo
- Publication number
- WO2010118931A1 WO2010118931A1 PCT/EP2010/053752 EP2010053752W WO2010118931A1 WO 2010118931 A1 WO2010118931 A1 WO 2010118931A1 EP 2010053752 W EP2010053752 W EP 2010053752W WO 2010118931 A1 WO2010118931 A1 WO 2010118931A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- database
- path distance
- search
- node
- database query
- Prior art date
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/24—Querying
- G06F16/242—Query formulation
- G06F16/2433—Query languages
- G06F16/2448—Query languages for particular applications; for extensibility, e.g. user defined types
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
Definitions
- the invention relates to a method and a device for generating a database for a database query. Furthermore, the invention relates to a search method and a search device for querying a database.
- Information values are made available to users via databases today.
- databases There are a variety of database languages with which the respective database can be described and queried in a structured manner.
- a representative for describing databases with semantic relations is, for example, RDF / OWL (RDF - Resource Description Framework, OWL - Web Ontology Language) [1, 2].
- RDF / OWL RDF - Resource Description Framework, OWL - Web Ontology Language
- informational values in the form of nodes are described, with two nodes and one directed edge between the two nodes being referred to as RDF triples.
- the two nodes represent a subject and an object and the directed edge a predicate.
- the predicate generally defines a semantic relation between the subject and the object. This will be explained in more detail using an example according to FIG.
- the node B represents the subject "person”
- the node A represents the object "Mario”
- the RDF triplet "BaA” reads "Person has name Mario”.
- a concatenation of such RDF triplets leads to a graph structure which reproduces a directed graph, see, for example, FIG. 1. Triples are outlined in bold in FIG.
- RDF / OWL can use a query language SPARQL (SPARQL - SPARQL Protocol and RDF Query Language) [3].
- SPARQL SPARQL - SPARQL Protocol and RDF Query Language
- a searched subgraph is realized by specifying all RDF triples involved. Therefore, to specify the above three RDF triplets, chains of RDF triplets including the RDF triplets framed in FIG. 2 must be specified. This approach requires that such a semantic database query is complex and time-consuming, since already in places of the database query an extensive knowledge of the structure of the database is needed.
- the invention relates to a method for generating a database for providing information values by means of nodes and dependencies of information values by means ge ⁇ directed edges for a database query, the database is formed in the form of a directed graph through the nodes and the directed edges, where the following steps are performed:
- the method achieves a reduction of the computing power in the search for specific triples, since a specification of the path distance achieves a reduction of the nodes to be examined.
- a device for generating a database for providing information values by means of nodes and dependencies of the information values using directed edges for a database query is part of the invention, wherein the database is formed in the form of a directed graph by the nodes and by the directed edges the device comprises the following means:
- the method for generating a database can be implemented.
- part of the invention is a search method for determining an information value in a database, wherein the database can be generated according to methods for generating a database, in which the following steps are performed:
- the search method achieves a reduction of the computing power in the search for specific triples in the database, since a specification of the path distance achieves a reduction of the nodes to be examined.
- searching through the database for determining the database query takes into account those triples which have a maximum path distance of the path distance specified in the search pattern to the node specified in the search pattern.
- the computing performance for performing the database query can be further reduced if, when searching the database for determining the database query, those triples are taken into account which have a path distance of exactly the path distance specified in the search pattern to the node specified in the search pattern.
- a value zero for the path distance in the search pattern is processed such that this path distance is set to at least one maximum path distance occurring in the database. This allows a full search of all nodes and triplets of the database regardless of the maximum occurring path distance.
- part of the invention is a search device for
- Determining an information value in a database wherein the database is generated according to the device for generating a database, comprising the following units:
- First unit for generating a database query by means of a search pattern comprising an indication of the predeterminable node, the path distance and the triple to be determined;
- Second database for searching the database for determining the database query, wherein the path distance specified in the search pattern is taken into account in the search;
- Third unit for providing at least one of the information values of at least one of the triples, which fulfills the specification of the search pattern.
- search method can be implemented. Further advantages, also for further developments of the search device are the respective corresponding features of the search method removable.
- the second unit is further configured in such a way as to search through the
- Database for determining the database query to take into account those triples having a maximum path distance of the path distance specified in the search pattern to the predetermined in the search pattern node.
- the second unit may be further configured to consider, when searching the database for determining the database query, those triples having a path distance from exactly the path distance specified in the search pattern to the node specified in the search pattern.
- the second unit is further configured such that a value zero for the path distance in the search pattern can be processed such that this path distance can be set at least to a maximum path distance occurring in the database.
- Figure 1 A structure of a database with edges and nodes according to a standard RDF / OWL (prior art);
- FIG. 2 A number of RDF triplets of the database to be considered in retrieving three RDF triplets (prior art);
- FIG. 3 shows a structure of a database according to an exemplary embodiment of the invention
- FIG. 4 shows a flowchart for creating the database according to FIG. 3;
- FIG. 5 Flow chart for querying the database.
- FIGS. 3 and 4 show an exemplary embodiment of the invention.
- a database is to be created for a semantic annotation of temporal and spatial allocations of a person to one or more rooms.
- FIG. 3 shows nodes and directed edges which can each receive specific information values or dependencies.
- the following reference symbols are used:
- directed edge for dependency aa "has name”
- a step STA the method is started with the steps S1 to S5 in order to create a database DB.
- a description specification DEF is read in which the assignment of two information values IA, IB with the associated dependency aa.
- the description specification DEF can be in the form of a paper sheet or as an electronic file and, for example, by means of a description language XML (XML - eXtensible Markup Language) represent the respective assignment.
- XML XML - eXtensible Markup Language
- the description rule describes the assignments as pictorially illustrated in FIG.
- step S2 the respective nodes A,..., G are formed for the respective information value IA,..., IG and the respective directed edges a,..., G for the dependencies aa,..., Gg.
- the edges are directed because the node where the directional edge originates, for example, a subject, and the node where the directional edge terminates corresponds to an object, where the directed edge represents a semantic relation of both edges.
- Two nodes connected to a directed edge and the associated directed edge are called triple TA, TF.
- the predeterminable node AA comes from the set of nodes and is a starting point for a database query.
- a path PF1 is formed by the predeterminable node AA to the triple TF to be determined during the database query.
- PFl AA-b-C-c-D-e-F
- PF2 AA-b-C-d-E-f-F
- a length of the paths i. a path distance is determined by a number of directed edges in the respective path.
- step S4 if there are several paths, the shortest path can be determined to be used subsequently. However, in the present example, both paths are the same length.
- step S5 the path distance DIS is added to the triplets TF.
- step END The flow chart according to FIG. 4 is ended in step END.
- the invention also relates to a search method for determining an information value in the database DB. According to FIG. 5, this query is started in state STA.
- a database query is generated by means of a search pattern.
- the search pattern QY is the predeterminable node instead of a predefinable path, as is the case in the prior art with the query language SPARQL.
- the associated information value, the distance to be considered in the search, and the triplet to be determined such as:
- step S7 that starting from the information value (person) with a path distance of 3, the triple (place "has name” name) is searched for. In the search thus only the triples are taken into account, the one
- Path distance of three In general, searching the database takes into account the path distance. Furthermore, the search method may determine the path that is least complex for the search.
- At least one information value of the triples determined by the search is output in step S8. Furthermore, further information values of the determined triple and / or the dependency can also be displayed. In addition, special value characteristics for at least one of the elements of the triple can be queried in the search pattern. This is the search pattern QY eg.
- step END The flow chart according to FIG. 5 is ended in step END.
- the triplets of the individual types can be stored by means of tables.
- involved tables In the evaluation of search patterns, that is to say of specifiable paths, involved tables must be linked together. The efficiency of the search depends essentially on the size of the tables and the respective selectivity.
- a search may be limited to the path that requires few computational steps. This can then be the path that is the shortest, that is, has the smallest path distance. In this case, fewer triples have to be processed in order to get from the predeterminable node to the triple TF to be determined. Furthermore, an advantage can result from the fact that in the processing of the triples by means of tables that path is selected which has the smallest possible tables.
- a table for the node D and another table for the node E are created. The table for node D contains a large number of entries and the table for node E contains only a small number of entries. Therefore, when using tables to implement the database, it is expedient to choose path PF2, which passes over node E and does not include node D. This reduces computational complexity.
- the search pattern that is to say the predefinable path
- the search pattern must be completely specified. In this case, a selection of paths leading from the predeterminable node to the triple TF to be determined is not possible.
- the invention makes it possible for the search pattern to have only the elements which are essential to the search, and the search method based on this search pattern can determine the optimum path for evaluating the search.
- a further advantage of the invention can be seen in the fact that a degree of detail in the database query can be set by specifying the distance in the search pattern. The greater the distance from the predeterminable node, the more detailed the degree of information. Thus, with the aid of the invention, it is also possible to specify a quality of the triple TF to be determined in the database query.
- a value of zero for the path distance may indicate that the search is to be performed without restriction to the distance. This is advantageous because this way the
- the method for generating the database can be carried out with the aid of five means M1, M2, M3, M4, M5 with the device VOR. Furthermore, the search method for determining an information value in the database by means of the units El, E2 and E4 are realized with the search device SVOR. These means and / or units may be implemented in hardware, software or a combination of hardware and software. In addition, the means and / or the units can be executed by means of a computer unit.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP10712921A EP2419840A1 (de) | 2009-04-15 | 2010-03-23 | Verfahren und vorrichtung zum generieren einer rdf-datenbank für eine rdf-datenbankabfrage, sowie ein suchverfahren und eine suchvorrichtung zur rdf-datenbankabfrage |
US13/264,676 US9213738B2 (en) | 2009-04-15 | 2010-03-23 | Method and device for generating an RDF database for an RDF database query and a search method and a search device for the RDF database query |
KR1020117027210A KR101662561B1 (ko) | 2009-04-15 | 2010-03-23 | Rdf 데이터베이스 질의를 위한 rdf 데이터베이스를 생성하기 위한 방법 및 디바이스, 및 rdf 데이터베이스 질의를 위한 검색 방법 및 검색 디바이스 |
CN201080016904.3A CN102395968B (zh) | 2009-04-15 | 2010-03-23 | 用于为rdf数据库查询生成rdf数据库的方法和设备以及用于rdf数据库查询的检索方法和检索设备 |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE102009017082A DE102009017082A1 (de) | 2009-04-15 | 2009-04-15 | Verfahren und Vorrichtung zum Generieren einer Datenbank für eine Datenbankabfrage, sowie ein Suchverfahren und eine Suchvorrichtung zur Datenbankabfrage |
DE102009017082.0 | 2009-04-15 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2010118931A1 true WO2010118931A1 (de) | 2010-10-21 |
Family
ID=42124486
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2010/053752 WO2010118931A1 (de) | 2009-04-15 | 2010-03-23 | Verfahren und vorrichtung zum generieren einer rdf-datenbank für eine rdf-datenbankabfrage, sowie ein suchverfahren und eine suchvorrichtung zur rdf-datenbankabfrage |
Country Status (6)
Country | Link |
---|---|
US (1) | US9213738B2 (de) |
EP (1) | EP2419840A1 (de) |
KR (1) | KR101662561B1 (de) |
CN (1) | CN102395968B (de) |
DE (1) | DE102009017082A1 (de) |
WO (1) | WO2010118931A1 (de) |
Families Citing this family (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CA2716436A1 (en) | 2010-03-01 | 2011-09-01 | Dundas Data Visualization, Inc. | Systems and methods for generating data visualization dashboards |
US20120089902A1 (en) | 2010-10-07 | 2012-04-12 | Dundas Data Visualization, Inc. | Systems and methods for dashboard image generation |
CA2737148A1 (en) | 2011-01-06 | 2012-07-06 | Dundas Data Visualization, Inc. | Methods and systems for providing a discussion thread to key performance indicator information |
KR102104496B1 (ko) * | 2013-09-06 | 2020-04-24 | 삼성전자주식회사 | 데이터 검색 방법 및 장치 |
US10162855B2 (en) | 2014-06-09 | 2018-12-25 | Dundas Data Visualization, Inc. | Systems and methods for optimizing data analysis |
US9953065B2 (en) | 2015-02-13 | 2018-04-24 | International Business Machines Corporation | Method for processing a database query |
CN105955999B (zh) * | 2016-04-20 | 2019-04-23 | 华中科技大学 | 一种大规模RDF图的ThetaJoin查询处理方法 |
US10311057B2 (en) | 2016-08-08 | 2019-06-04 | International Business Machines Corporation | Attribute value information for a data extent |
US10360240B2 (en) | 2016-08-08 | 2019-07-23 | International Business Machines Corporation | Providing multidimensional attribute value information |
CN109983457B (zh) * | 2016-11-23 | 2023-11-21 | 开利公司 | 具有启用语义的建筑系统数据访问的建筑管理系统 |
KR101997491B1 (ko) * | 2017-09-07 | 2019-07-08 | 호서대학교 산학협력단 | 모바일 기기로 구현되는 이미지 어노테이션 방법 |
KR20210033770A (ko) * | 2019-09-19 | 2021-03-29 | 삼성전자주식회사 | 지식 그래프에 기초하여 콘텐트를 제공하는 방법 및 장치 |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020059566A1 (en) * | 2000-08-29 | 2002-05-16 | Delcambre Lois M. | Uni-level description of computer information and transformation of computer information between representation schemes |
US20020174087A1 (en) * | 2001-05-02 | 2002-11-21 | Hao Ming C. | Method and system for web-based visualization of directed association and frequent item sets in large volumes of transaction data |
US6771831B2 (en) * | 2001-11-16 | 2004-08-03 | California Institute Of Technology | Data compression method and system using globally optimal scalar quantization |
US7702725B2 (en) * | 2004-07-02 | 2010-04-20 | Hewlett-Packard Development Company, L.P. | Digital object repositories, models, protocol, apparatus, methods and software and data structures, relating thereto |
EP1752919A1 (de) * | 2005-07-29 | 2007-02-14 | Amadeus s.a.s | Verfahren und System zur Erzeugung von aktuellen Reisegebühren |
US20080033993A1 (en) * | 2006-08-04 | 2008-02-07 | International Business Machines Corporation | Database Access Through Ontologies With Semi-Automatic Semantic Mapping |
KR100820746B1 (ko) * | 2007-01-22 | 2008-04-11 | 조선대학교산학협력단 | 온톨로지를 이용한 정보의 브라우징 시스템 및 방법 |
US8244772B2 (en) * | 2007-03-29 | 2012-08-14 | Franz, Inc. | Method for creating a scalable graph database using coordinate data elements |
US7890518B2 (en) * | 2007-03-29 | 2011-02-15 | Franz Inc. | Method for creating a scalable graph database |
US20100241644A1 (en) * | 2009-03-19 | 2010-09-23 | Microsoft Corporation | Graph queries of information in relational database |
US9031933B2 (en) * | 2013-04-03 | 2015-05-12 | International Business Machines Corporation | Method and apparatus for optimizing the evaluation of semantic web queries |
-
2009
- 2009-04-15 DE DE102009017082A patent/DE102009017082A1/de not_active Ceased
-
2010
- 2010-03-23 US US13/264,676 patent/US9213738B2/en not_active Expired - Fee Related
- 2010-03-23 KR KR1020117027210A patent/KR101662561B1/ko active IP Right Grant
- 2010-03-23 WO PCT/EP2010/053752 patent/WO2010118931A1/de active Application Filing
- 2010-03-23 EP EP10712921A patent/EP2419840A1/de not_active Ceased
- 2010-03-23 CN CN201080016904.3A patent/CN102395968B/zh not_active Expired - Fee Related
Non-Patent Citations (7)
Title |
---|
ALKHATEEB F ET AL: "Extending SPARQL with regular expression patterns (for querying RDF)", WEB SEMANTICS: SCIENCE, SERVICES AND AGENTS ON THE WORLD WIDE WEB, ELSEVIER LNKD- DOI:10.1016/J.WEBSEM.2009.02.002, vol. 7, no. 2, 1 April 2009 (2009-04-01), pages 57 - 73, XP026104536, ISSN: 1570-8268, [retrieved on 20090321] * |
KEMAFOR ANYANWU AND AMIT SHETH: "P-Queries: Enabling Querying for Semantic Associations on the Semantic Web", ACM, NEW YORK, NY, USA, WWW '03: PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, BUDAPEST, HUNGARY, 1 January 2003 (2003-01-01), pages 690 - 699, XP009133456, ISBN: 978-1-58113-680-7 * |
KRYS J KOCHUT ET AL: "SPARQLeR: Extended Sparql for Semantic Association Discovery", 3 June 2007, THE SEMANTIC WEB: RESEARCH AND APPLICATIONS; [LECTURE NOTES IN COMPUTER SCIENCE;;LNCS], SPRINGER BERLIN HEIDELBERG, BERLIN, HEIDELBERG, PAGE(S) 145 - 159, ISBN: 9783540726661, XP019094608 * |
MACIEJ JANIK ET AL: "BRAHMS: A WorkBench RDF Store and High Performance Memory System for Semantic Association Discovery", 1 January 2005, THE SEMANTIC WEB - ISWC 2005 LECTURE NOTES IN COMPUTER SCIENCE;;LNCS, SPRINGER, BERLIN, DE, PAGE(S) 431 - 445, ISBN: 9783540297543, XP019022767 * |
RALF HARTMUT GUETING: "GraphDB: Modeling and Querying Graphs in Databases", PROCEEDINGS OF THE 20TH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES / 20TH VLDB CONFERENCE, SEPTEMBER 12 - 15, 1994, SANTIAGO - CHILE, MORGAN KAUFMANN, UK, 12 September 1994 (1994-09-12), pages 297 - 308, XP009133460, ISBN: 978-1-55860-153-6 * |
RENZO ANGLES ET AL: "Querying RDF Data from a Graph Database Perspective", 19 May 2005, THE SEMANTIC WEB: RESEARCH AND APPLICATIONS; [LECTURE NOTES IN COMPUTER SCIENCE;;LNCS], SPRINGER-VERLAG, BERLIN/HEIDELBERG, PAGE(S) 346 - 360, ISBN: 9783540261247, XP019009870 * |
TIM FURCHE ET AL: "RDF Querying: Language Constructs and Evaluation Methods Compared", 1 January 2006, REASONING WEB LECTURE NOTES IN COMPUTER SCIENCE;;LNCS, SPRINGER, BERLIN, DE, PAGE(S) 1 - 52, ISBN: 9783540384090, XP019039639 * |
Also Published As
Publication number | Publication date |
---|---|
CN102395968B (zh) | 2015-10-07 |
KR20120022957A (ko) | 2012-03-12 |
DE102009017082A1 (de) | 2010-11-04 |
CN102395968A (zh) | 2012-03-28 |
US20120041974A1 (en) | 2012-02-16 |
EP2419840A1 (de) | 2012-02-22 |
US9213738B2 (en) | 2015-12-15 |
KR101662561B1 (ko) | 2016-10-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2010118931A1 (de) | Verfahren und vorrichtung zum generieren einer rdf-datenbank für eine rdf-datenbankabfrage, sowie ein suchverfahren und eine suchvorrichtung zur rdf-datenbankabfrage | |
DE112015003406B4 (de) | Datenherkunftssummierung | |
DE60004385T2 (de) | Verfahren und systeme um olap hierarchien zusammenfassbar zu machen | |
US20180039692A1 (en) | Information Query Method And Device | |
DE112016005536T5 (de) | Bestimmen von reihenfolgen einer ausführung eines neuronalen netzes | |
DE112019001533T5 (de) | Erweiterung von trainingsdaten für die klassifikation von natürlicher sprache | |
US20100281045A1 (en) | Methods and systems for representing, using and displaying time-varying information on the semantic web | |
DE202014010938U1 (de) | Omega-Namen: Namenserzeugung und -ableitung | |
DE112016005266T5 (de) | Schnelle Musterentdeckung für Protokollanalyse | |
DE112018005616T5 (de) | Blockweise extraktion von dokumentmetadaten | |
DE112018006345T5 (de) | Abrufen von unterstützenden belegen für komplexe antworten | |
DE112013005993T5 (de) | Verfahren, Vorrichtung und computerlesbares Medium für eine optimale Bestimmung von Daten-Teilmengen | |
DE112012003541T5 (de) | Automatische Erkennung von Elementlisten innerhalb einer Webseite | |
DE112020001874T5 (de) | Datenextraktionssystem | |
DE112018005076T5 (de) | Erstellen einer rangfolge von dokumenten auf grundlage ihres semantischen reichtums | |
DE10149693A1 (de) | Objekte in einem Computersystem | |
KR101987915B1 (ko) | 자연어 질의로부터 지식 베이스에 대한 쿼리의 생성에 사용되는 템플릿을 생성하는 시스템 및 이를 포함하는 질의 응답 시스템 | |
DE112008004025T5 (de) | Analysieren von Ereignissen | |
DE112021000338B4 (de) | Auslagern der statistikerfassung | |
DE112020000554T5 (de) | Verfahren zum zugreifen auf datensätze eines stammdatenverwaltungssystems | |
DE112018002626T5 (de) | Verfahren und Systeme zur optimierten visuellen Zusammenfassung von Sequenzen mit zeitbezogenen Ereignisdaten | |
DE102012204167A1 (de) | Vorauslaufende genäherte Berechnungen | |
DE102021109465A1 (de) | Hierarchie-erkennung für blockschaltbilder | |
DE202013012665U1 (de) | Methode zur Implementierung von strukturierten und unstrukturierten Daten in XML-Dokumenten | |
CN109062946A (zh) | 一种基于多网页的突出显示方法及装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 201080016904.3 Country of ref document: CN |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 10712921 Country of ref document: EP Kind code of ref document: A1 |
|
REEP | Request for entry into the european phase |
Ref document number: 2010712921 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2010712921 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 13264676 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
ENP | Entry into the national phase |
Ref document number: 20117027210 Country of ref document: KR Kind code of ref document: A |