<?xml version="1.0"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">A   quantum logic-based query processing approach for extending relational query languages</dc:title>
  <dc:contributor xmlns:dc="http://purl.org/dc/elements/1.1/">Lehrack, Sebastian (VerfasserIn)</dc:contributor>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Text</dc:type>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Text</dc:type>
  <dc:date xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">2009</dc:date>
  <dc:date xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">2009</dc:date>
  
  <dc:language xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">eng</dc:language>
  <dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">electronic resource</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">remote</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Computermedien</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Online-Ressource</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">1 Online-Ressource (Seiten 63-67)</dc:format>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Evaluating a traditional database query against a data tuple returns a true on match and a false on mismatch. Unfortunately, there are many application scenarios where such an evaluation is not possible or does not adequately meet users needs. A further problematic application area is text retrieval where in general finding a complete match is impossible. Thus, there is a need for incorporating impreciseness and proximity into a logic-based query language: Objects fulfill such a similarity condition to a certain degree which is expressed by a result value out of the interval [0, 1]. In this work we will sketch a quantum logic-based approach, which provides the combination of classical Boolean predicates and similarity conditions into one integrating formalism.&lt;eng&gt;</dc:description>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Sebastian Lehrack</dc:description>
  <dc:subject xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">004</dc:subject>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">http://purl.uni-rostock.de/rosdok/id00002191</dc:identifier>
  <dc:relation xmlns:dc="http://purl.org/dc/elements/1.1/">21. Workshop Grundlagen von Datenbanken--(DE-627)616202938--(DE-576)9616202936</dc:relation>
  
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">urn:nbn:de:gbv:28-rosdok_id00002191-2</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">doi: 10.18453/rosdok_id00002191</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">ppn:
				(DE-627)62533759X</dc:identifier>
</oai_dc:dc>
