By Topic

A stochastic programming approach for range query retrieval problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xian Liu ; Dept. of Syst. Eng., Arkansas Univ., Little Rock, AR, USA ; Wilsun Xu

One of the important issues in range query (RQ) retrieval problems is to determine the key's resolution for multi-attribute records. Conventional models need to be improved because of their potential degeneracy, less-than-desired computability and possible inconsistency with the partial match query (PMQ) models. This paper presents a new RQ model to overcome these drawbacks and introduces a new methodology, stochastic programming (SP), to conduct the optimization process. The model is established by using a monotone-increasing function to characterize range sizes. Three SP approaches - the wait-and-see (WS), here-and-now (HN) and scenario tracking (ST) methods - are integrated into this RQ model. Analytical expressions of the optimal solution are derived. It seems that HN has advantage over WS because the latter usually involves complicated multiple summations or integrals. For the ST method, a nonlinear programming software package is designed. Results of numerical experiments are presented that optimized a 10-dimensional RQ model and tracked both middle-size (100) and large-size (1,000) scenarios

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:14 ,  Issue: 4 )