Method and apparatus for searching in a memory-efficient manner for at least one query data element

• US 8,788,483 B2
• Filed: 06/21/2010
• Issued: 07/22/2014
• Est. Priority Date: 06/19/2009
• Status: Active Grant

• Current Assignee: Siemens AG
• Original Assignee: Siemens AG
• Inventors: Heuer, Jrg, Kind, Roland, Kuntschke, Richard, Peintner, Daniel
• Primary Examiner(s): Rostami, Mohammad S
• Application Number:
  US12/819,280
• Publication Number:
  US 20100325151A1
• Time in Patent Office: 1,492 Days
• Field of Search: None
• US Class Current: 707/717
• CPC Class Codes: G06F 16/9027 Trees

Abstract

In a method and an apparatus (1) for searching in a memory-efficient manner for at least one query data element in a graph (2A), only as many data elements are read into a memory as are required for their subsequent processing. Increased memory efficiency is ensured as a result of this. The proposed apparatus is particularly suitable for use in terminals having very limited memory, in particular in mobile terminals.

Claims

1. A method for searching in a memory-efficient manner for a query data element in a graph comprising:

receiving or accessing the graph, which comprises a data structure including data elements arranged according to relationships between particular data elements,

segmenting the query data element into multiple query data segments including at least a first query data segment and a second query data segment, using predefined segmenting metrics;

after segmenting the query data element using the predefined segmenting metrics, identifying the multiple query data segments in the graph, which comprises subordinate data elements and superordinate data elements, by an iterative process including;

identifying a first one of the multiple data segments in the graph by;

a) determining whether or not the first query data segment is present in the graph by comparing each of a plurality of existing subordinate data elements of the graph with the first query data segment, wherein each subordinate data element is connected to a superordinate data element by exactly one edge in the graph;

b) storing a particular subordinate data element as a new superordinate data element in response to determining that the particular subordinate data element features the first query data segment; and

treating the particular subordinate data element, stored as a new superordinate data element, as a superordinate data element for identifying a second one of the multiple query data segments in the graph, such that identifying the second query data segment includes comparing existing subordinate data elements of the new superordinate data element with the second query data segment.

2. The method according to claim 1, wherein the storage of the particular subordinate data element as a superordinate data element is executed in such a way that a previously stored superordinate data element is overwritten by the particular subordinate data element.

3. The method according to claim 1, wherein the storage of the particular subordinate data element as a superordinate data element is executed in such a way that a previously stored superordinate data element is deleted from a memory and the particular subordinate data element is written into the memory.

4. The method according to claim 1, wherein the query data element is segmented into a plurality of ordered query data segments, and the identification of the query data segments in the graph is executed in accordance with an order of the multiple query data segments.

5. The method according to claim 1, wherein the query data element describes a path in the graph.

6. The method according to claim 1, wherein the query data segment features a binary code, a superordinate data element, a subordinate data element, a node, a URL, a URI, a virtual folder and/or a file name.

7. The method according to claim 1, wherein at least part of the graph is described by an XML document, a binary code, a graphical representation, a textual description, an ontological language, a formal model, a relational database and/or a graph description language.

8. The method according to claim 1, wherein the superordinate data element corresponds to a root data element in the context of a first comparison of the subordinate data element with the query data segment.

9. The method according to claim 1, wherein at least one of the query data segment, the query data element, the subordinate data element and the superordinate data element comprise at least one attribute.

10. The method according to claim 1, wherein the method is used in a mobile terminal.

11. An apparatus for searching in a memory-efficient manner for a query data element in a graph comprising:

a segmentation unit for;

receiving or accessing the graph, which comprises a data structure including data elements arranged according to relationships between particular data elements, and

segmenting the query data element into multiple query data segments including at least a first query data segment and a second query data segment, using predefined segmenting metrics;

an iteration unit for, after segmenting the query data element using the predefined segmenting metrics, identifying the multiple query data segments in the graph, which comprises subordinate data elements and superordinate data elements, by an iterative process including;

identifying a first one of the multiple query data segments in the graph by;

a) determining whether or not the first query data segment is present in the graph by comparing each of a plurality of existing subordinate data elements of the graph with the first query data segment, wherein each subordinate data element is connected to a superordinate data element by exactly one edge in the graph;

b) storing a particular subordinate data element as a new superordinate data element in response to determining that the particular subordinate data element features the first query data segment; and

treating the particular subordinate data element, which was stored as a new superordinate data element, as a superordinate data element for identifying a second one of the multiple query data segments in the graph, such identifying the second query data segment includes comparing existing subordinate data elements of the new superordinate data element with the second query data segment.

12. The apparatus according to claim 11, comprising a data memory for storing at least part of the graph.

13. The apparatus according to claim 11, comprising a readout unit for reading out at least part of the graph from a remote data memory.

14. The apparatus according to claim 12, comprising a first interface unit for receiving at least part of at least one of the graph, of the query data element, of the query data segment, of the superordinate data element and of the subordinate data element.

15. The apparatus according to claim 12, comprising a second interface unit for providing at least part of at least one of the graph, of the query data element, of the query data segment, of the superordinate data element and of the subordinate data element.

16. The apparatus according to claim 15, wherein the first interface unit and the second interface unit are available as a combined interface.

17. A computer program product comprising a non-transitory data memory storing instructions which when executed on a computer perform a method for searching in a memory-efficient manner for a query data element in a graph comprising:

receiving or accessing the graph, which comprises a data structure including data elements arranged according to relationships between particular data elements,

segmenting the query data element into multiple query data segments including at least a first query data segment and a second query data segment, using predefined segmenting metrics;

after segmenting the query data element using the predefined segmenting metrics, identifying the multiple query data segments in the graph, which comprises subordinate data elements and superordinate data elements, by an iterative process including;

identifying a first one of the multiple query data segments in the graph by;

a) determining whether or not the first query data segment is present in the graph by comparing each of a plurality of existing subordinate data elements of the graph with the first query data segment, wherein each subordinate data element is connected to a superordinate data element by exactly one edge in the graph;

b) storing a particular subordinate data element as a new superordinate data element in response to determining that the particular subordinate data element features the first query data segment; and

treating the particular subordinate data element which was stored as a new superordinate data element, as a superordinate data element for identifying a second one of the multiple query data segments in the graph, such identifying the second query data segment includes comparing existing subordinate data elements of the new superordinate data element with the second query data segment.

18. The computer program product according to claim 17, wherein the storage of the particular subordinate data element as a superordinate data element is executed in such a way that a previously stored superordinate data element is overwritten by the particular subordinate data element.

19. The computer program product according to claim 17, wherein the storage of the particular subordinate data element as a superordinate data element is executed in such a way that a previously stored superordinate data element is deleted from a memory and the particular subordinate data element is written into the memory.

20. The computer program product according to claim 17, wherein the query data element is segmented into a plurality of ordered query data segments, and the identification of the query data segments in the graph is executed in accordance with a order of the multiple query data segments.