Database support for matching: Limitations and opportunities

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2006, Pages 85-96

  Kini, Ameet ^a   Shankar, Srinath ^a   Naughton, Jeffrey F ^a   Dewitt, David J ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

Advanced query types; Join; Matching

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; QUERY PROCESSING; RESOURCE ALLOCATION;

ADVANCED QUERY TYPES; GRAPH-MATCHING ALGORITHMS; MATCHING PROBLEMS;

DATABASE SYSTEMS;

EID: 34250649382     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142473.1142484     Document Type: Conference Paper

References (21)

1. R. Agrawal and H.V. Jagadish. "Materialization and Incremental Update of Path Information", Proceedings of ICDE 1989, p.374-383.
2. R. Agrawal and E. Wimmers. "A Framework for Expressing and Combining Preferences", Proceedings of ACM SIGMOD 2000, p. 297-306.
3. R. K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
4. C. Berge, "Two Theorems in Graph Theory" Proceedings of the National Academy of Science USA, 1957, p. 842-844.
5. Y. Chang et al. "The Onion Technique: Indexing for Linear Optimization Queries", Proceedings of ACM SIGMOD 2000, p. 391-402.
6. J. Feigenbaum et al., "On Graph Problems in a Semi-Streaming Model", Proceedings of ICALP 2004, p. 531-543
7. A.V. Goldberg and R. E. Tarjan. "A new approach to the maximum-flow problem", Journal of the ACM (JACM), v.35 n.4, Oct 1988, p. 921-940.
8. L Gravano and S. Chaudhuri. "Evaluating Top-k Selection Queries", Proceedings of VLDB 1999, p. 397-410
9. S. Guha et al. "Efficient Approximation of Optimization Queries Under Parametric Aggregation Constraints", Proceedings of VLDB 2003, p. 778-789
10. S. Guha et al. "Merging the Results of Approximate Match Operations", Proceedings of VLDB 2004, p. 636-647.
11. 5/2 Algorithm for Maximum Matching in Bipartite Graphs", SIAM Journal of Computing, 1975, p. 225-231.
12. I. Ilyas et al. "Supporting Top-k Join Queries in Relational Databases", VLDB Journal, v.13 n.3, p. 207-221.
13. R. Karp, U.V. Vazirani, and V.V. Vazirani. "An optimal algorithm for online bipartite matching", Proceedings of ACM STOC 1990, p. 352-358.
14. st Workshop on Algorithm Engineering, p. 22-31, 1997.
15. A. Mehta et al. "AdWords and Generalized Online Matching", Proceedings of IEEE FOCS 2005, p. 264-273.
16. Predator Project, http://www.distlab.dk/predator/
17. R. Raman et al. "Matchmaking: Distributed Resource Management for High Throughput Computing", Proceedings of IEEE HPDC 1998, p. 140-146.
18. C. Schlup. "Automatic Game Matching", http://dcg.ethz.ch/ theses/ws0203/OnlineMatching_asbtract.pdf
19. T. Tannenbaum et al. "Condor - A Distributed Job Scheduler", Beowulf Cluster Computing with Linux, The MIT Press, 2002.
20. P. Tsaparas et al. "Ranked Join Indices", Proceedings of IEEE ICDE 2003, p. 277-288.
21. http://www.research.microsoft.com/mlp/trueskill/default.aspx