Items where Project is "Miscellaneous" and Year is 1999
Jump to: A Reuse and Composition Protocol for Services | Capability-Sensitive Query Processing on Internet Sources | Clindex: Clustering for Similarity Queries in High-Dimensional Spaces. | Computing Complete Answers to Queries with Binding Restrictions | Data Management for XML: Research Directions | Efficient Computation of PageRank | Hybrid Search for Optimization of High-Dimensional k-d Trees | MARS: Runtime Support for Coordinated Application | Pipeline Expansion in Coordinated Applications | Testing Query Containment in the Presence of Binding Restrictions | The INEEL Data Integration Mediation System Number of items: 11.
A Reuse and Composition Protocol for ServicesBeringer, D. and Wiederhold, G. and Melloul, L. (1999) A Reuse and Composition Protocol for Services. In: Fifth Symposium on Software Reusability (SSR 1999) , May 21-23, 1999, Los Angeles, CA. Capability-Sensitive Query Processing on Internet SourcesGarcia-Molina, H. and Labio, W. and Yerneni, R. (1999) Capability-Sensitive Query Processing on Internet Sources. In: 15th International Conference on Data Engineering (ICDE 1999), March 23-26, 1999, Sydney, Austrialia. Clindex: Clustering for Similarity Queries in High-Dimensional Spaces.Li, C. and Chang, E. and Garcia-Molina, H. and Wang, J. and Wiederhold, G. (1999) Clindex: Clustering for Similarity Queries in High-Dimensional Spaces. Technical Report. Stanford. Computing Complete Answers to Queries with Binding RestrictionsLi, C. (1999) Computing Complete Answers to Queries with Binding Restrictions. Technical Report. Stanford. Data Management for XML: Research DirectionsWidom, J. (1999) Data Management for XML: Research Directions. Technical Report. Stanford. (Publication Note: IEEE Data Engineering Bulletin 22(3), September 1999) Efficient Computation of PageRankHaveliwala, T. (1999) Efficient Computation of PageRank. Technical Report. Stanford. Hybrid Search for Optimization of High-Dimensional k-d TreesSample, N. and Haines, M. and Arnold, M. and Purcell, T. (1999) Hybrid Search for Optimization of High-Dimensional k-d Trees. Technical Report. Stanford. MARS: Runtime Support for Coordinated ApplicationSample, N. and Bartlett, C. and Haines, M. (1999) MARS: Runtime Support for Coordinated Application. In: ACM Symposium on Applied Computing (SAC 1999), February 28-March 2, 1999 , San Antonio, Texas. Pipeline Expansion in Coordinated ApplicationsBartlett, C. and Sample, N. and Haines, M. (1999) Pipeline Expansion in Coordinated Applications. In: International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 1999) , June 28 - July 1, 1999 , Las Vegas, Nevada. Testing Query Containment in the Presence of Binding RestrictionsLi, Chen and Chang, Edward (1999) Testing Query Containment in the Presence of Binding Restrictions. Technical Report. Stanford. The INEEL Data Integration Mediation SystemPanchapagesan, P and Hui, J. and Wiederhold, G. and Erickson, S. and Dean, L. and Hempstead, A. (1999) The INEEL Data Integration Mediation System. In: International ICSC Symposium on Advances in Intelligent Data Analysis (AIDA 1999), June 22-25, 1999, Rochester, NY. |