A vision for management of complex models

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 29, Issue 4, 2000, Pages 55-63

  Bernstein, Philip A ^a   Halevy, Alon Y ^b   Pottinger, Rachel A ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002219090     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/369275.369289     Document Type: Article

References (38)

1. Rakesh Agrawal, Shaul Dar, and H. V. Jagadish. Direct transitive closure algorithms: Design and performance evaluation. TODS, 15(3):427-458, 1990.
2. Rakesh Agrawal and H. V. Jagadish. Direct algorithms for computing the transitive closure of database relations. In Peter M. Stocker, William Kent, and Peter Hammersley, editors, Proc. of VLDB, pages 255-266. Morgan Kaufmann, 1987.
3. P. A. Bernstein, T. Bergstraesser, J. Carlson, P. Sanders S. Pal, and D. Shutt. Microsoft repository version 2 and the open information model. Information Systems, 24(2):71-98, 1999.
4. Sonia Bergamaschi, Silvana Castano, and Maurizio Vincini. Semantic integration of semi structured and structured data sources. SIGMOD Record, 28(1):54-59, 1999.
5. Jay Banerjee, Won Kim, Hyoung-Joo Kim, and Henry F. Korth. Semantics and implementation of schema evolution in object-oriented databases. In Proc. of SIGMOD, pages 311-322, 1987.
6. Philip A. Bernstein, Alon Y. Levy, and Rachel A. Pottinger. A vision for management of complex models. Technical Report MSR-TR-2000-53, Microsoft Research, Available from http://research.microsoft.com/pubs/., 2000.
7. François Bancilhon, David Maier, Yehoshua Sagiv, and Jeffrey D. Ullman. Magic sets and other strange ways to implement logic programs. In Proc. of PODS, pages 1-16, 1986.
8. Alex Borgida. Description logics in data management. IEEE Transactions on Knowledge and Data Engineering, 7(5):671-682, 1995.
9. Franois Bancilhon and Raghu Ramakrishnan. An amateur's introduction to recursive query processing strategies. In Proc. of SIGMOD, pages 16-52, 1986.
10. Philip A. Bernstein and Erhard Rahm. Data warehouse scenarios for model management. In Proceedings of the Entity Relationship Conference, pages 1-15. Springer Verlag, 2000.
11. R.G.G. Cattell, Rick Catell, Douglas K. Barry, Mark Berler, Jeff Eastman, David Jordan, Craig Russell, Olaf Schadow, Torsten Stanienda, and Fernando Velez, editors. The Object Data Standard: ODMG 3.0. Morgan Kaufmann Publishers, 2000.
12. Sudarshan S. Chawathe and Hector Garcia-Molina. Meaningful change detection in structured data. In Proc. of SIGMOD, 1997.
13. Kajal T. Claypool, Jing Jin, and Elke A. Rundensteiner. Serf: Schema evalution through an extensible, reusable and flexible framework. In Proc. of CIKM, pages 314-321, 1998.
14. Sudarshan S. Chawathe, Anand Rajaraman, Hector Garcia-Molina, and Jennifer Widom. Change detection in hierarchically structured information. In Proc. of SIGMOD, 1996.
15. Anhai Doan, Pedro Domings, and Alon Y. Levy. Learning source descriptions for data integration. In In Proc. of WebDB, 2000.
16. Guozhu Dong and Chaoyi Pang. Maintaining transitive closure in first order after node-set and edge-set deletions. Information Proc. Letters, 62(4):193-199, 1997.
17. Shaul Dar and Raghu Ramakrishnan. A performance study of transitive closure algorithms. In Proc. of SIGMOD, pages 454-465, 1994.
18. Guozhu Dong and Jianwen Su. Incremental and decremental evaluation of transitive closure by first-order queries. Information and Computation, 120(1):101-106, 1995.
19. G. Dong and J. Su. Incremental maintenance of recursive views using relational calculus / SQL. SIGMOD Record, pages 44-51, 2000.
20. Alon Y. Halevy. Answering queries using views: A survey. To appear in the VLDB Journal, 2001.
21. Yannis E. Ioannidis, Raghu Ramakrishnan, and Linda Winger. Transitive closure algorithms based on graph traversal. TODS, 18(3):512-576, 1993.
22. H. V. Jagadish. A compression technique to materialize transitive closure. TODS, 15(4):558-598, 1990.
23. Matthias Jarke and Manfred A Jeusfeld. Rule representation and management in ConceptBase. SIGMOD Record, 18(3):46-51, 1989.
24. Jan Jannink, Prasenjit Mitra, Erich Neuhold, Srinivasan Pichai, Rudi Studer, and Gio Wiederhold. An algebra for semantic interoperation of semistructured data. In IEEE Knowledge and Data Engineering Exchange Workshop (KDEX), 1999.
25. M. Kifer, G. Lausen, and J. Wu. Logical foundations of object-oriented and frame-based languages. J. ACM, 42(4):741-843, 1995.
26. Chien-Tsai Liu, Shi-Kuo Chang, and Panos K. Chrysanthis. Database schema evolution using EVER diagrams. In Proceedings of the Workshop on Advanced Visual Interfaces, pages 123-132, New York, New York, USA, 1994.
27. John Mylopoulos, Alexander Borgida, Matthias Jarke, and Manolis Koubarakis. Telos: Representing knowledge about information systems. ACM TOIS, 8(4):325-362, 1990.
28. Renee J. Miller, Laura Haas, and Mauricio Hernandez. Schema mapping as query discovery. In Proc. of VLDB, 2000.
29. Renne J. Miller, Yannis E. Ioannidis, and Raghu Ramakrishnan. The use of information capacity in schema integration and translation. In Proc. of VLDB, pages 120-133, 1993.
30. John Mylopoulos and Renate Motschnig-Pitrik. Partitioning information bases with contexts. In Proceedings of 3rd CoopIS, pages 44-54, 1995.
31. Prasenjit Mitra, Gio Wiederhold, and Martin L. Kersten. A graph-oriented model for articulation of ontology interdependencies. In Proc. of EDBT, pages 86-100, 2000.
32. E. Myers. An o(nd) difference algorithm and its variations. Algorithmica, 1(2):251-266, 1986.
33. Tova Milo and Sagit Zohar. Using schema matching to simplify heterogeneous data translation. In Proc. of VLDB, New York City, USA, 1998.
34. L. Palopoli, D. Saccà, and D. Ursino. Semi-automatic, semantic discovery of properties from database schemes. In Proceedingsof IDEAS'98, pages 244-253. IEEE Press, Cardiff, United Kingdom, 1998.
35. N.C. Shu, B.C. Housel, R.W. Taylor, S.P. Ghosh, and V.Y. Lum. Express: A data extraction, processing and restructuring system. ACM Transactions on Database Systems, 2(2):134-174, 1977.
36. Dennis Shasha and Kaizhong Zhang. Fast algorithms for the unit cost editing distance between trees. J. Algorithms, 11(4):581-621, 1990.
37. Jason Tsong-Li Wang, Dennis Shasha, George Jyh-Shian Chang, Liam Relihan, Kaizhong Zhang, and Girish Patel. Structural matching and discovery in document databases. In Proc. of SIGMOD, pages 560-563, 1997.
38. Kaizhong Zhang, Jason Tsong-Li Wang, and Dennis Shasha. On the editing distance between undirected acyclic graphs and related problems. In Proceedings of CPM, pages 395-407, 1995.