Answering linear optimization queries with an approximate stream index

Knowledge and Information Systems

Volumn 20, Issue 1, 2009, Pages 95-121

  Luo, Gang ^a   Wu, Kun Lung ^a   Yu, Philip S ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Indexing method; Linear optimization query; Query processing; Relational database; Stream processing

Indexed keywords

DATA STREAMS; INDEXING (MATERIALS WORKING); LINEAR PROGRAMMING;

INDEXING METHODS; LIMITED MEMORY; LINEAR OPTIMIZATION; OUTER LAYER; RELATIONAL DATABASE; SLIDING WINDOW; STREAM INDEX; STREAM PROCESSING;

QUERY PROCESSING;

EID: 67649991184     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-008-0157-z     Document Type: Article

References (38)

1. Abadi DJ, Carney D, Çetintemel U et al (2003) Aurora: A new model and architecture for data stream management. VLDB J 12(2):120-139
2. Agarwal PK, Har-Peled S, Varadarajan KR (2004) Approximating extent measures of points. JACM 51(4):606-635
3. Babcock B, Babu S, Datar M et al (2002) Models and issues in data stream systems. PODS, pp 1-16
4. Bruno N, Chaudhuri S, Gravano L (2002) Top-k selection queries over relational databases: Mapping strategies and performance evaluation. TODS 27(2):153-187
5. Barber CB, Dobkin DP, Huhdanpaa H (1996) The quickhull algorithm for convex hulls. ACM Trans Math Softw 22(4):469-483
6. Bangolae SL, Jayasumana AP, Chandrasekar V (2003) Gigabit Networking: digitized radar data transfer and beyond. ICC, pp 684-688
7. Böhm C, Kriegel HP (2001) Determining the convex hull in large multidimensional databases. DaWaK, pp 294-306
8. Chang YC, Bergman LD, Castelli V et al (2000) The onion technique: indexing for linear optimization queries. SIGMOD, pp 391-402
9. Chandrasekaran S, Cooper O, Deshpande A et al (2003) TelegraphCQ: continuous dataflow processing for an uncertain world. CIDR
10. Chang KC, Hwang SW (2002) Minimal probing: Supporting expensive predicates for top-k queries. SIGMOD, pp 346-357
11. Carey MJ, Kossmann D (1997) On Saying "Enough Already!" in SQL. SIGMOD, pp 219-230
12. Cormode G, Muthukrishnan S (2003) Radial histograms for spatial streams. Technical Report 2003-11 DIMACS
13. Clarkson KL, Mehlhorn K, Seidel R (1993) Four results on randomized incremental constructions. Comput Geom 3:185-212
14. Dantzig GB (1963) Linear programming and extensions. Princeton University Press, NJ
15. DeWitt DJ, Gray J (1992) Parallel database systems: The future of high performance database systems. CACM 35(6):85-98
16. Donjerkovic D, Ramakrishnan R (1999) Probabilistic optimization of top N queries. VLDB, pp 411-422
17. Fagin R (1996) Combining fuzzy information from multiple systems. PODS, pp 216-226
18. Fagin R, Lotem A, Naor M (2001) Optimal aggregation algorithms for middleware. PODS, pp 102-113
19. Gibbons PB, Matias Y (1999) Synopsis data structures for massive data sets. SODA, pp 909-910
20. Hristidis V, Koudas N, Papakonstantinou Y (2001) PREFER: A system for the efficient execution of multi-parametric ranked queries. SIGMOD, pp 259-270
21. Hardy GH, Littlewood JE, Polya G (1934) Inequalities. Cambridge University Press, London
22. Hershberger J, Suri S (2004) Adaptive sampling for geometric problems over data streams. PODS, pp 252-262
23. Ilyas IF, Aref WG, Elmagarmid AK (2004) Supporting top-k join queries in relational databases. VLDB J 13(3):207-221
24. Li CS, Chang YC, Bergman LD et al (2000) Model-based multi-modal information retrieval from large archives. ICDCS International Workshop of Knowledge Discovery and Data Mining in the World-Wide Web
25. Li CS, Chang YC, Smith JR et al (2001) SPIRE/EPI-SPIRE model-based multi-modal information retrieval from large archives. MMCBIR
26. Marian A, Bruno N, Gravano L (2004) Evaluating top-k queries over web-accessible databases. TODS 29(2):319-362
27. Mouratidis K, Bakiras S, Papadias D (2006) Continuous monitoring of top-k queries over sliding windows. SIGMOD, pp 635-646
28. O'Rourke J (1998) Computational geometry in C, 2nd edn. Cambridge University Press, London
29. Preparata FP, Shamos MI (1985) Computational geometry - an introduction. Springer, Berlin
30. Sullivan DG, Seltzer MI (2000) Isolation with flexibility: A resource management framework for central servers. USENIX General Track, pp 337-350
31. 2005 UC Data Mining Competition Homepage. http://mill.ucsd.edu
32. Waldspurger CA, Weihl WE (1994) Lottery scheduling: Flexible proportional-share resource management. OSDI, pp 1-11
33. Yi K, Yu H, Yang J et al (2003) Efficient maintenance of materialized top-k views. ICDE, pp 189-200
34. Luo G, Wu K, Yu PS (2007) SAO: A stream index for answering linear optimization queries. ICDE, pp 1302-1306
35. Gedik B, Wu K, Yu PS et al (2007) CPU load shedding for binary stream joins. KAIS 13(3):271-303
36. Cho M, Pei J, Wang K (2007) Answering ad hoc aggregate queries from data streams using prefix aggregate trees. KAIS 12(3):301-329
37. Agarwal D (2007) Detecting anomalies in cross-classified streams: A bayesian approach. KAIS 11(1):29-44
38. Kalousis A, Prados J, Hilario M (2007) Stability of feature selection algorithms: A study on high-dimensional spaces. KAIS 12(1):95-116