A general framework for modeling and processing optimization queries

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 1069-1080

  Gibas, Michael ^a   Zheng, Ning ^a   Ferhatosmanoglu, Hakan ^a  

^a The Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION;

MODEL BASED OPTIMIZATION; OBJECT ATTRIBUTES; OPTIMAL SOLUTIONS; OPTIMIZATION FUNCTION; OPTIMIZATION OBJECTIVE FUNCTION; PROBLEM CONSTRAINTS; PROCESSING OPTIMIZATIONS; SPACE PARTITIONING;

QUERY PROCESSING;

EID: 79959967498     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. S. Berchtold, C. Böhm, D. A. Keim, and H.-P. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. PODS, pages 78-86, 1997.
2. Christian Bohm, Stefan Berchtold, and Daniel A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv., 33(3):322-373, 2001.
3. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, New York, NY. USA, 2004.
4. Y-C. Chang, L. Bergman, V. Castelli, C-S. Li, M-L. Lo, and R. J. Smith. The onion technique: indexing for linear optimization queries. ACM SIGMOD, 2000.
5. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences, 2003.
6. H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, and A. El Abbadi. Vector approximation based indexing for non-uniform high dimensional data sets. In CIKM '00.
7. Volker Gaede and Oliver Gunther. Multidimensional access methods. ACM Comput. Surv., 30(2):170-231, 1998.
8. A. Gionis, P. Indyk, and R. Motwani. Similarity searching in high dimensions via hashing. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 518-529, Edinburgh, Sootland, UK, September 1999.
9. M. Grant, S. Boyd, and Y. Ye. Disciplined convex programming. Kluwer (Nonconvex Optimization and its Applications series), Dordrecht, 2005. In press.
10. Gisli R. Hjaltason and Hanan Samet. Ranking in spatial databases. In Symposium on Large Spatial Databases, pages 83-95, 1995.
11. V. Hristidis, N. Koudas, and Y. Papakonstantinou. PREFER: A system for the efficient execution of multi-parametric ranked queries. In SIGMOD Conference, 2001.
12. F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In SIGMOD, 2000.
13. M. S. Lobo. Robust and Convex Optimization with Applications in Finance. PhD thesis, The Department of Electrical Engineering, Stanford University, March 2000.
14. B. S. Manjunath. Airphoto dataset. http://vivaldi.ece.ucsb.edu/Manjunath/research.htm, May 2000.
15. B. S. Manjunath and W. Y. Ma. Texture features for browsing and retrieval of image data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(8):837-842, August 1996.
16. R. P. Mount. The Office of Science Data-Management Challenge. DOE Office of Advanced Scientific Computing Research, March-May 2004.
17. Y. Nesterov and A. Nemirovsky. A general approach to polynomial-time algorithms design for convex programming. Technical report, Centr. Econ. & Math. Inst., USSR Acad. Sci., Moscow, USSR, 1988.
18. Y. Nesterov and A. Nemirovsky. Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, PA 19101, USA, 1994.
19. N. Roussopoulos, S. Kelly, and F. Vincent. Nearest neighbor queries. In SIGMOD, 1995.
20. M. Theobald, G. Weikum, and R. Schenkel. Top-k query evaluation with probabilistic guarantees. VLDB, 2004.
21. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In VLDB, 1998.
22. Z. Zhang, S. Hwang, K. C.-C. Chang, M. Wang, C. Lang, and Y. Chang. Boolean + ranking: Querying a database by k-constrained optimization. In SIGMOD, 2006.