Hierarchical or relational? A case for a modern hierarchical data model
暂无分享,去创建一个
[1] Laks V. S. Lakshmanan,et al. Snakes and sandwiches: optimal clustering strategies for a data warehouse , 1999, SIGMOD '99.
[2] Joyce K. Reynolds,et al. Technical Overview of Directory Services Using the X.500 Protocol , 1992, RFC.
[3] Laks V. S. Lakshmanan,et al. Querying network directories , 1999, SIGMOD '99.
[4] H. V. Jagadish. Incorporating hierarchy in a relational model of data , 1989, SIGMOD '89.
[5] Divesh Srivastava,et al. Substring selectivity estimation , 1999, PODS '99.
[6] Divesh Srivastava,et al. Multi-Dimensional Substring Selectivity Estimation , 1999, VLDB.
[7] Divesh Srivastava,et al. One-dimensional and multi-dimensional substring selectivity estimation , 2000, The VLDB Journal.
[8] Roy Goldman,et al. From Semistructured Data to XML: Migrating the Lore Data Model and Query Language , 1999, Markup Lang..
[9] Balachander Krishnamurthy,et al. Focusing search in hierarchical structures with directory sets , 1998, CIKM '98.
[10] T. Howes,et al. LDAP: programming directory-enabled applications with lightweight directory access protocol , 1997 .
[11] Laks V. S. Lakshmanan,et al. What can Hierarchies do for Data Warehouses? , 1999, VLDB.
[12] H. V. Jagadish. The INCINERATE data model , 1995, TODS.
[13] Divesh Srivastava,et al. Flexible list management in a directory , 1998, CIKM '98.
[14] J. D. Uiiman,et al. Principles of Database Systems , 2004, PODS 2004.
[15] Udi Manber,et al. GLIMPSE: A Tool to Search Through Entire File Systems , 1994, USENIX Winter.
[16] Laks V. S. Lakshmanan,et al. On Bounding-Schemas for LDAP Directories , 2000, EDBT.