Approximate query processing model for mobile computing

  • Authors:
  • Sanjay Kumar Madria;Mukesh Mohania;John F. Roddick

  • Affiliations:
  • Purdue Univ., West Lafayette, IN;Western Michigan Univ;Flinders Univ., Australia

  • Venue:
  • Information organization and databases
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a query-processing model for mobile computing using summary databases (database stored in some predefined condensed form). We use concept hierarchies to generate summary databases from the main database in various ways. Traditional database management systems are correct in that they are able to provide answers to queries that are both sound and complete with respect to the source data. In a mobile environment, it may be advantageous to relax one or other of these criteria to enhance availability through the use of summary databases. This would provide a more optimal use of data during periods of disconnection and to enable efficient utilization of low bandwidth and restricted memory size. The model for query processing proposed uses concept hierarchies and summary databases at run time to return approximate queries when access to the main database is either undesirable or unavailable.