<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T08:36:20Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/7864" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/7864</identifier><datestamp>2026-05-14T13:57:20Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Lin, Guo</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-07-02T13:37:17Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-07-02T13:37:17Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-07-02T13:37:17Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/7864</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6475900</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Traditionally, relational database systems have been designed for precise &#xd;
queries over structured data, while information retrieval systems have been &#xd;
designed for more flexible ranked keyword search queries over unstructured &#xd;
(text) data. However, many new and emerging applications require data &#xd;
management capabilities that combine the benefits of database and information &#xd;
retrieval systems, e.g., e-commerce and content management applications. In &#xd;
this dissertation, we have proposed and initiated steps toward the larger &#xd;
goal of integrating relational database and information retrieval systems.&#xd;
&#xd;
&#xd;
First, we consider the problem of ranked text search in relational databases,&#xd;
where the traditional ranking paradigms and techniques developed for stand-alone &#xd;
unstructured documents are not directly applicable. We thus propose a new &#xd;
ranking paradigm that uses structured data values to score the results of &#xd;
text search queries. Our experimental results on real and synthetic data&#xd;
sets show that we can support the new ranking paradigm efficiently in &#xd;
relational databases.&#xd;
&#xd;
Second, we explore a novel problem of discovering rich relationships in &#xd;
databases based on user queries with text search and structural query conditions.&#xd;
Toward this end, we have introduced the notion of data topology and developed &#xd;
efficient algorithms for computing ranked topologies based on user queries. &#xd;
We have evaluated our algorithms using a real biological database, the&#xd;
Biozon database (http://www.biozon.org).&#xd;
&#xd;
Third, we consider the problem of efficiently producing results for keyword &#xd;
search queries over semi-structured XML documents. We present the XRANK system &#xd;
that is built to address the novel challenges for effective XML keyword search &#xd;
as apposed to HTML keyword search. Our experimental results show that XRANK&#xd;
offers both space and performance benefits when compared with existing&#xd;
approaches.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1166715 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">ranked search</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">structured data</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">semi-structured data</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">XML</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">keyword search</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">relationship search</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Ranked search over structured and semi-structured data</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Lin, Guo</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="79db1193-bb04-4666-819c-1d288cef769f">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>Ranked search over structured and semi-structured data&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2007-07-02T13:37:17Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Lin, Guo&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>ranked search&lt;/Keyword>
    &lt;Keyword>structured data&lt;/Keyword>
    &lt;Keyword>semi-structured data&lt;/Keyword>
    &lt;Keyword>XML&lt;/Keyword>
    &lt;Keyword>keyword search&lt;/Keyword>
    &lt;Keyword>relationship search&lt;/Keyword>
   	&lt;Abstract>Traditionally, relational database systems have been designed for precise &#xd;
queries over structured data, while information retrieval systems have been &#xd;
designed for more flexible ranked keyword search queries over unstructured &#xd;
(text) data. However, many new and emerging applications require data &#xd;
management capabilities that combine the benefits of database and information &#xd;
retrieval systems, e.g., e-commerce and content management applications. In &#xd;
this dissertation, we have proposed and initiated steps toward the larger &#xd;
goal of integrating relational database and information retrieval systems.&#xd;
&#xd;
&#xd;
First, we consider the problem of ranked text search in relational databases,&#xd;
where the traditional ranking paradigms and techniques developed for stand-alone &#xd;
unstructured documents are not directly applicable. We thus propose a new &#xd;
ranking paradigm that uses structured data values to score the results of &#xd;
text search queries. Our experimental results on real and synthetic data&#xd;
sets show that we can support the new ranking paradigm efficiently in &#xd;
relational databases.&#xd;
&#xd;
Second, we explore a novel problem of discovering rich relationships in &#xd;
databases based on user queries with text search and structural query conditions.&#xd;
Toward this end, we have introduced the notion of data topology and developed &#xd;
efficient algorithms for computing ranked topologies based on user queries. &#xd;
We have evaluated our algorithms using a real biological database, the&#xd;
Biozon database (http://www.biozon.org).&#xd;
&#xd;
Third, we consider the problem of efficiently producing results for keyword &#xd;
search queries over semi-structured XML documents. We present the XRANK system &#xd;
that is built to address the novel challenges for effective XML keyword search &#xd;
as apposed to HTML keyword search. Our experimental results show that XRANK&#xd;
offers both space and performance benefits when compared with existing&#xd;
approaches.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication&gt;
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>