Perspectives on operations research in data and knowledge management

European Journal of Operational Research

Volumn 111, Issue 1, 1998, Pages 1-14

  Basu, Amit ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

Database systems; Knowledge base systems; Models; Performance analysis

Indexed keywords

COMPUTER SIMULATION; DATABASE SYSTEMS; DYNAMIC PROGRAMMING; KNOWLEDGE BASED SYSTEMS; RANDOM PROCESSES;

KNOWLEDGE MANAGEMENT; PERFORMANCE ANALYSIS;

OPERATIONS RESEARCH;

EID: 0032210241     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00316-0     Document Type: Article

References (107)

1. R.K. Abbott, H. Garcia-Molina, Scheduling real-time transactions: A performance evaluation, ACM Transactions on Database Systems 17 (3) (1992) 513-560.
2. M. Abdelguerfi, A.K. Sood, Computational complexity of sorting and joining relations with duplicates, IEEE Transactions on Knowledge and Data Engineering 3 (4) (1991) 496-503.
3. D. Agrawal, S. Sengupta, Modular synchronization in distributed, multiversion databases: Version control and concurrency control, IEEE Transactions on Knowledge and Data Engineering 5 (1) (1993) 126-137.
4. D. Agrawal, A. El Abbadi, A.E. Lang, The performance of protocols based on locks with ordered sharing, IEEE Transactions on Knowledge and Data Engineering 6 (5) (1994) 805-818.
5. R. Agrawal, M.J. Carey, M. Livny, Concurrency control performance modeling: Alternatives and implications, ACM Transactions on Database Systems 12 (4) (1987) 609-654.
6. R. Agrawal, S. Dar, H.V. Jagadish, Direct transitive closure algorithms: Design and performance evaluation, ACM Transactions on Database Systems 15 (3) (1990) 427-458.
7. R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, Proceedings of the ACM SIGMOD International Conference on Management of Data, 1993, pp. 207-216.
8. R. Agrawal, T. Imielinski, A. Swami, Database mining: A performance perspective, IEEE Transactions on Knowledge and Data Engineering 5 (6) (1993) 914-925.
9. R. Alonso, D. Barbara, H. Garcia-Molina, Data caching issues in an information retrieval system, ACM Transactions on Database Systems 15 (3) (1990) 359-384.
10. Y.M. Babad, J.A. Hoffer, A mathematical programming model for the location of access controls in a distributed database environment, Operations Research 32 (1) (1984) 23-40.
11. A. Bagchi, A. Mahanti, Three approacties to heuristic search in networks, Journal of the ACM 32(1) (1985) 1-27.
12. C. Baral, S. Kraus, J. Minker, Combining multiple knowledge bases, IEEE Transactions on Knowledge and Data Engineering 3 (2) (1991) 208-220.
13. A. Basu, A knowledge representation model for multi-user knowledge-based systems, IEEE Transactions on Knowledge and Data Engineering 5 (2) (1993) 177-189.
14. P. Bernstein, N. Goodman, Concurrency control in distributed database systems, ACM Computing Surveys 13 (2) (1981) 185-222.
15. E. Bertino, W. Kim, Indexing techniques for queries on nested objects, IEEE Transactions on Knowledge and Data Engineering 1 (2) (1989) 196-214.
16. C.E. Blair, R.G. Jeroslow, J.K. Lowe, Some results and experiments in programming techniques for propositional logic, Computers and Operations Research 5 (1986) 633-645.
17. F. Bukhari, S.L. Osborn, Two fully distributed concurrency control algorithms, IEEE Transactions on Knowledge and Data Engineering 5 (5) (1993) 872-881.
18. M.J. Carey, M. Livny, Conflict detection tradeoffs for replicated data, ACM Transactions on Database Systems 16 (4) (1991) 703-746.
19. U.S. Chakravarthy, J. Grant, J. Minker, Foundations of Semantic Query Optimization for Deductive Databases, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988.
20. I.-R. Chen, B. Poole, Performance evaluation of rule grouping on a real-time expert system architecture, IEEE Transactions on Knowledge and Data Engineering 6 (6) (1994) 883-891.
21. S.Y. Cheung, M.H. Ammar, M. Ahamad, The grid protocol: A high performance scheme for maintaining replicated data, IEEE Transactions on Knowledge and Data Engineering 4 (6) (1992) 582-591.
22. B. Ciciani, D.M. Dias, P.S. Yu, Analysis of replication in distributed database systems, IEEE Transactions on Knowledge and Data Engineering 2 (2) (1990) 247-261.
23. R.L. Cole, G. Graefe, Optimization of Dynamic Query Evaluation Plans, Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994, pp. 150-160.
24. A.E. Croker, V. Dhar, A knowledge representation for constraint satisfaction problems, IEEE Transactions on Knowledge and Data Engineering 5 (5) (1993) 740-752.
25. P. Dasgupta, Z.M. Kedem, The five-color concurrency control protocol: Non-two-phase locking in general databases, ACM Transactions on Database Systems 15 (2) (1990) 281-307.
26. C.J. Date, An Introduction to Database Systems, 6th ed., Addison-Wesley, Reading, MA, 1994.
27. S.B. Davidson, H. Garcia-Molina, D. Skeen, Consistency in partitioned networks, ACM Computing Surveys 17 (3) (1985) 341-370.
28. M. Davis, H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7 (2) (1960) 201-215.
29. R. Dewan, B. Gavish, Combined logical and physical design of databases, IEEE Transactions on Communications 38 (7) (1989) 955-967.
30. V. Dhar, N. Ranganathan, Integer programming vs. expert systems: An experimental comparison, Communications of the ACM 33 (3) (1990) 323-336.
31. V. Dhar, A. Tuzhilin, Abstract-driven pattern discovery in databases, IEEE Transactions on Knowledge and Data Engineering 5 (6) (1993) 926-938.
32. V.V. Dixit, D.I. Moldovan, Minimal state space search in parallel production systems, IEEE Transactions on Knowledge and Data Engineering 3 (4) (1991) 435-443.
33. P.E. Drenick, E.J. Smith, Stochastic query optimization in distributed databases, ACM Transactions on Database Systems 18 (2) (1993) 262-288.
34. A. Dutta, A. Basu, An artificial intelligence approach to model management in decision support systems, IEEE Computer 17 (9) (1984) 89-97.
35. C.L. Forgy, Rete: A fast algorithm for the many pattern/many object pattern match problem, Artificial Intelligence 19 (1982) 17-37.
36. P.A. Franaszek, J.T. Robinson, A. Thomasian, Concurrency control for high contention environments, ACM Transactions on Database Systems 17 (3) (1992) 304-345.
37. G. Gallo, G. Urbani, Algorithms for testing the satisfiability of propositional formulae, Journal of Logic Programming 7 (1) (1989) 45-61.
38. B. Gavish, A. Segev, Set query optimization in distributed database systems, ACM Transactions on Database Systems 11 (3) (1986) 265-293.
39. S. Ghandeharizadeh, L. Ramos, Continuous retrieval of multimedia data using parallelism, IEEE Transactions on Knowledge and Data Engineering 5 (4) (1993) 658-669.
40. D. Ghosh, I. Murthy, A solution procedure for the file allocation problem with file availability and response time, Computers and Operations Research 18 (6) (1991) 557-568.
41. P. Goes, A stochastic model for performance evaluation of main memory resident database systems, INFORMS Journal on Computing 7 (3) (1995) 269-282.
42. M.M. Gooley, B.W. Wah, Efficient reordering of prolog programs, IEEE Transactions on Knowledge and Data Engineering 1 (4) (1989) 470-482.
43. R.D. Gopal, R. Ramesch, S. Zionts, Access path optimization in relational joins, INFORMS Journal on Computing 7 (3) (1995) 257-268.
44. G. Graefe, Query evaluation techniques for large databases, ACM Computing Surveys 25 (2) (1993) 73-170.
45. J. Gu, Global optimization for satisfiability (SAT) problem, IEEE Transactions on Knowledge and Data Engineering 6 (3) (1994) 361-381.
46. A. Gupta, C.L. Forgy, A. Newell, R. Wedig, Parallel Algorithms and Architectures for Rule-Based Systems, Proceedings of the International Symposium on Computing Architecture, 1986, pp. 28-37.
47. P. Helman, A. Rosenthal, A mass production technique to speed multiple query optitimization and physical database design, ORSA Journal on Computing 3 (1) (1993) 33-55.
48. A.R. Hevner, S.B. Yao, Query processing in distributed database, IEEE Transactions on Software Engineering 5 (3) (1979) 177-187.
49. J.A. Hoffer, A. Kovacevic, Optimal performance of inverted files, Operations Research 30 (2) (1982) 336-354.
50. J.N. Hooker, Generalized resolution and cutting planes, Annals of Operations Research 12 (1988) 217-239.
51. J.N. Hooker, A quantitative approach to logical inference, Decision Support Systems 4 (1) (1988) 45-69.
52. M. Hsu, B. Zhang, Performance evaluation of cautious waiting, ACM Transactions on Database Systems 17 (3) (1992) 477-512.
53. Y. Ioannidis, R. Ramakrishnan, L. Winger, Transitive closure algorithms based on graph traversal, ACM Transactions on Database Systems 18 (3) (1993) 512-576.
54. Y. Ioannidis, S. Christodoulakis, Optimal histograms for limiting worst-case error propagation in the size of join results, ACM Transactions on Database Systems 18 (4) (1993) 709-748.
55. T. Ishida, Parallel rule firing in production systems, IEEE Transactions on Knowledge and Data Engineering 3(1) (1991) 11-17.
56. R. Jagannathan, Optimal partial-match hashing design, ORSA Journal on Computing 3 (2) (1991) 86-91.
57. S. Jajodia, D. Mutchler, Dynamic voting algorithms for maintaining the consistency of a replicate database, ACM Transactions on Database Systems 15 (2) (1990) 230-280.
58. S. Jajodia, D. Mutchier, Integrating static and dynamic voting protocols to enhance file availability, Proceedings of the Fourth International Conference on Data Engineering, 1988, pp. 144-153.
59. M. Jarke, J. Koch, Query optimization in database systems, ACM Computing Surveys 16 (2) (1984) 111-152.
60. R.G. Jeroslow, J. Wang, Solving prepositional satisfiability problems, Annals of Mathematics and Artificial Intelligence 1 (1990) 167-187.
61. J.L. Johnson, A neural network approach to the 3-satisfiability problem, Journal of Parallel and Distributed Computing 6 (1989) 435-449.
62. T. Johnson, D. Shasha, The performance of current B-tree algorithms, ACM Transactions on Database Systems 18 (1) (1993) 51-101.
63. M. Kifer, E.L. Lozinskii, On compile-time query optimization in deductive databases by means of static filtering, ACM Transactions on Database Systems 15 (3) (1990) 385-426.
64. W. Kim, K.C. Kim, A. Dale, Indexing techniques for object-oriented databases, in: W. Kim, F. Lochovsky (Eds.), Object-Oriented Concepts, Databases and Applications, Addison-Wesley, Reading, MA, 1989.
65. Kumar, A. Berger, Performance measurement of some main memory database recovery algorithms, Proceedings of the Seventh International Conference on Data Engineering, Kobe, 1991, pp. 436-443.
66. R. Lanzelotte, P. Valduriez, M. Zait, Optimization of object-oriented recursive queries using cost controlled strategies, Proceedings of the ACM SIGMOD International Conference on Management of Data, 1992, pp. 256-265.
67. L. Li, Fast in-place verification of data dependencies, IEEE Transactions on Knowledge and Data Engineering 5 (2) (1993) 266-281.
68. D.B. Lomet, A simple bounded disorder file organization with good performance, ACM Transactions on Database Systems 13 (4) (1988) 525-551.
69. D.B. Lomet, B. Salzberg, The hB-tree: A multiattribute indexing method with good guaranteed performance, ACM Transactions on Database Systems 15 (4) (1990) 625-658.
70. C.J. Matheus, P.K. Chan, G. Piatetsky-Shapiro, Systems for knowledge discovery in databases, IEEE Transactions on Knowledge and Data Engineering 5 (6) (1993) 903-913.
71. G. Matsliach, Performance analysis of file organizations that use multibucket data leaves with partial expansions, ACM Transactions on Database Systems 18 (1) (1993) 157-180.
72. W.J. McIver, R. King, Self-adaptive, on-line reclustering of complex object data, Proceedings of the ACM SIGMOD International Conference on Management of Data, 1994, pp. 407-418.
73. H. Mendelson, U. Yechiali, Optimal policies for database reorganization, Operations Research 29 (1) (1981) 23-36.
74. H. Mendelson, U. Yechiali, Physical design for a random-access file with random insertions and deletions, Computers and Operations Research 13 (4) (1986) 489-505.
75. Y. Nakamura, S. Abe, Y. Ohsawa, M. Sakauchi, A balanced hierarchial data structure for multidimensional data with highly efficient dynamic characteristics, IEEE Transactions on Knowledge and Data Engineering 54 (1993) 682-694.
76. N.J. Nilsson, Principles of Artificial Intelligence, Tioga (Press), Palo Alto, CA, 1980.
77. E. Omiecinski, P. Scheuermann, A parallel algorithm for record clustering, ACM Transaction on Database Systems 15 (4) (1990) 599-624.
78. H. Pirkul, An integer programming model for the allocation of databases in a distributed computer system, European Journal of Operational Research 26 (3) (1986) 401-411.
79. H. Pirkul, H.-P. Hou, Allocating primary and backup copies of databases in distributed computing systems: A model and solution procedures, Computers and Operations Research 16 (3) (1989) 235-245.
80. E. Rahm, Empirical performance evaluation of concurrency and coherency control protocols for database sharing systems, ACM Transactions on Database Systems 18 (2) (1993) 333-377.
81. S. Ram, S. Narasimhan, Data allocation in a distributed environment: Incorporating concurrency control and queueing costs, Management Science 40 (8) (1994) 969-983.
82. S. Ram, S. Narasimhan, Incorporating the majority consensus concurrency control mechanism into the data base allocation problem, INFORMS Journal on Computing 7 (3) (1995) 244-256.
83. R. Ramesh, A.J.G. Babu, J.P. Kincaid, Variable-depth trie index optimization: Theory and experimental results, AMC Transactions on Database Systems 14 (1) (1989) 41-74.
84. K. Ravindran, V. Bansal, Delay compensation protocols for synchronization of multimedia data streams, IEEE Transactions on Knowledge and Data Engineering 5 (4) (1993) 589-674.
85. J.A. Robinson, A machine-oriented logic based on the resolution principle, Journal of the ACM 12 (1)(1965) 23-41.
86. Y. Sagiv, O. Shumueli, Solving queries by tree projections, ACM Transactions on Database Systems 18 (3) (1993) 487-511.
87. K. Salem, H. Garcia-Molina, J. Shands, Altruistic locking, ACM transactions on database systems 19 (1) (1994) 117-165.
88. H. Salem, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1989.
89. O.T. Satyanarayanan, D. Agrawal, Efficient execution of read-only transactions in replicated multi-version databases, IEEE Transactions on Knowledge and Data Engineering 5 (5) (1993) 859-871.
90. T.K. Sellis, N. Roussopoulos, C. Faloutsos, The R+ tree: A dynamic index for multidimensional objects, Proceedings of the 13th VLDB Conference, 1987.
91. T.K. Sellis, Multiple query optimization, ACM Transactions on Database Systems 13 (1) (1988) 23-52.
92. D. Shasha, T.-L. Wang, Optimizing equijoin queries in distributed databases where relations are hash-partitioned, ACM Transactions on Database Systems 16 (2) (1991) 279-308.
93. S. Shekhar, B. Hamidzadeh, A. Kohli, M. Coyle, Learning transformation rules for semantic query optimization: A data-driven approach, IEEE Transactions on Knowledge and Data Engineering 5 (6) (1993) 950-964.
94. F.J. Shekita, K.-L. Tan, Multijoin Optimization for Symmetric Multiprocessors, Proceedings of the 19th VLDB Conference, 1993, pp. 479-492.
95. O.R.L. Sheng, H. Lee, Data allocation design in computer networks: LAN versus MAN versus WAN, Annals of Operations Research 36 (1) (1992) 125-150.
96. P.P. Shenoy, Consistency in valuation-based systems, ORSA Journal on Computing 6 (3) (1994) 281-291.
97. R. Srikanth, A graph theory-based approach for partitioning knowledge bases, INFORMS Journal on Computing 7 (3) (1995) 286-297.
98. M.M. Srinivasan, K. Kant, The file allocation problem - A queueing network optimization approach, Computers and Operations Research 14 (5) (1987) 349-361.
99. A.B. Stephens, Y. Yesha, K. Humenik, Optimal allocation for partially replicated database systems on ring networks, IEEE Transactions on Knowledge and Data Engineering 6 (6) (1994) 975-982.
100. G. Sudhakar, A. Karmouch, N.D. Georganas, Design and performance evaluation considerations of a multimedia medical database, IEEE Transactions on Knowledge and Data Engineering 5 (5) (1993) 888-894.
101. A. Thomasian, Two-phase locking performance and its thrashing behavior, ACM Transactions on Database Systems 18 (4) (1993) 579-625.
102. E. Triantaphyllou, A.L. Soyster, A relationship between CNF and DNF systems derivable from examples, INFORMS Journal on Computing 7 (3) (1995) 283-285.
103. J.T. Wang et al., Combinatorial pattern discovery for scientific data: Some preliminary results, Proceedings of the ACM SIGMOD Internatinal Conference on Management of Data, 1994, pp. 115-125.
104. K.-Y. Whang, B.T. Vander-Zanden, H.M. Taylor, A linear-time probabilistic counting algorithm for database applications, ACM Transactions on Database Systems 15 (2) (1990) 208-229.
105. K.-Y. Whang, R. Krishnamurthy, Query optimization in a memory resident domain calculus database system, ACM Transactions on Database Systems 15 (1) (1990) 67-95.
106. P.S. Yu, A. Leff, Y.-H. Lee, On robust transaction routing and load sharing, ACM Transactions on Database Systems 16 (3) (1991) 476-512.
107. H. Samet, The design and analysis of spatial data structures, Addison-Wesley, Reading, MA, 1989.