Difference between revisions of "SC²S Colloquium - November 14, 2012"

From Sccswiki
Jump to navigation Jump to search
(Created page with "{| class="wikitable" |- | '''Date:''' || November 14, 2012 |- | '''Room:''' || 02.07.023 |- | '''Time:''' || 3 pm, s.t. |- |} == Manuel Schlick: Design and implementation of...")
 
 
Line 12: Line 12:
 
== Manuel Schlick: Design and implementation of efficient free text search algorithms in the DS-2 framework  ==
 
== Manuel Schlick: Design and implementation of efficient free text search algorithms in the DS-2 framework  ==
  
Abstract: t.b.a.
+
Since the search in DS-2 framework's data structure enquires a high degree of system understanding, the user is to be supported by introducing a new and alternative search method. But also because it affords just a limited way of searching and comparison for a simple and fast-acting enquiry, it is to enable a query over all internal data objects, instead of being limited to a single data object.
 +
Besides, the algorithm supports the input of several conditions at the same time, which can be connected with diverse logical operators and can be combined in different levels.
 +
Using the company-internal classes, an algorithm has been developed, which transfers the one-dimensional input string into the internal, for the search necessary, multi-dimensional tree structure. This algorithm has been analysed in terms of its several steps of development and their performance improvement. Important steps are located in the pre-processing of the query, what particularly affects the time of the server request, and as well in the post-processing of the results, for whose performance increase recommendations will be given.
  
 
[[Category:ShowComingUp]]
 
[[Category:ShowComingUp]]
 
[[Category:news]]
 
[[Category:news]]

Latest revision as of 19:39, 8 November 2012

Date: November 14, 2012
Room: 02.07.023
Time: 3 pm, s.t.


Manuel Schlick: Design and implementation of efficient free text search algorithms in the DS-2 framework

Since the search in DS-2 framework's data structure enquires a high degree of system understanding, the user is to be supported by introducing a new and alternative search method. But also because it affords just a limited way of searching and comparison for a simple and fast-acting enquiry, it is to enable a query over all internal data objects, instead of being limited to a single data object. Besides, the algorithm supports the input of several conditions at the same time, which can be connected with diverse logical operators and can be combined in different levels. Using the company-internal classes, an algorithm has been developed, which transfers the one-dimensional input string into the internal, for the search necessary, multi-dimensional tree structure. This algorithm has been analysed in terms of its several steps of development and their performance improvement. Important steps are located in the pre-processing of the query, what particularly affects the time of the server request, and as well in the post-processing of the results, for whose performance increase recommendations will be given.