Back to results

Computer Science

Efficient Indexing for Structured and Unstructured Data

Abstract

dc:description.abstract

The collection of digital data is growing at an exponential rate. Data originates from wide range of data sources such as text feeds, biological sequencers, internet traffic over routers, through sensors and many other sources. To mine intelligent information from these sources, users have to query the data. Indexing techniques aim to reduce the query time by preprocessing the data. Diversity of data sources in real world makes it imperative to develop application specific indexing solutions based on the data to be queried. Data can be structured i.e., relational tables or unstructured i.e., free text. Moreover, increasingly many applications need to seamlessly analyze both kinds of data making data integration a central issue. Integrating text with structured data needs to account for missing values, errors in the data etc. Probabilistic models have been proposed recently for this purpose. These models are also useful for applications where uncertainty is inherent in data e.g. sensor networks. This dissertation aims to propose efficient indexing solutions for several problems that lie at the intersection of database and information retrieval such as joining ranked inputs, full-text documents searching etc. Other well-known problems of ranked retrieval and pattern matching are also studied under probabilistic settings. For each problem, the worst-case theoretical bounds of the proposed solutions are established and/or their practicality is demonstrated by thorough experimentation.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (PhD)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Computer Sciences
Grantor
Computer Science
Year dc:date.available
2014

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Patil, Manish Madhukar

Subjects

dc:subject × 5

Rights

dc:rights
Statement dc:rights
  • unrestricted
  • Release the entire work immediately for access worldwide.

Identifiers

dc:identifier.*
OAI identifier oai:identifier
oai:repository.lsu.edu:gradschool_dissertations-1784

Chain of custody

source
Harvested from
Lousiana State University
Base URL
repository.lsu.edu/do/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Patil, Manish Madhukar. Efficient Indexing for Structured and Unstructured Data. Dissertation thesis, Computer Science, 2014. https://doi.org/10.31390/gradschool_dissertations.785