![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Ning An Ravi Kanth V. Kothuri , Siva Ravada , Ning An: Incorporating Updates in Domain Indexes: Experiences with Oracle Spatial R-trees. ICDE 2004 : 745-753 Sudhanva Gurumurthi , Ning An, Anand Sivasubramaniam , Narayanan Vijaykrishnan , Mahmut T. Kandemir , Mary Jane Irwin : Energy and Performance Considerations in Work Partitioning for Mobile Spatial Queries. IPDPS 2003 : 33 Ning An, Kothuri Venkata Ravi Kanth , Siva Ravada : Improving Performance with Bulk-Inserts in Oracle R-Trees. VLDB 2003 : 948-951 Ning An, Ji Jin , Anand Sivasubramaniam : Toward an Accurate Analysis of Range Queries on Spatial Data. IEEE Trans. Knowl. Data Eng. 15 (2): 305-323 (2003) Ning An, Sudhanva Gurumurthi , Anand Sivasubramaniam , Narayanan Vijaykrishnan , Mahmut T. Kandemir , Mary Jane Irwin : Energy-performance trade-offs for spatial access methods on memory-resident data. VLDB J. 11 (3): 179-197 (2002) Ning An, Zhen-Yu Yang , Anand Sivasubramaniam : Selectivity Estimation for Spatial Joins. ICDE 2001 : 368-375 Ning An, Anand Sivasubramaniam , Narayanan Vijaykrishnan , Mahmut T. Kandemir , Mary Jane Irwin , Sudhanva Gurumurthi : Analyzing energy behavior of spatial access methods for memory-resident data. VLDB 2001 : 411-420 Ji Jin , Ning An, Anand Sivasubramaniam : Analyzing Range Queries on Spatial Data. ICDE 2000 : 525-534 Ning An, R. Lu , Liujian Qian , Anand Sivasubramaniam , Tom Keefe : Storing spatial data on a network of workstations. Cluster Computing 2 (4): 259-270 (1999) Ning An, Liujian Qian , Anand Sivasubramaniam , Tom Keefe : Evaluating Parallel R-Tree Implementations on a Network of Workstations (Extended Abstract). ACM-GIS 1998 : 159-160 1 [ 4 ] [ 6 ] [ 9 ] 2 [ 4 ] [ 6 ] [ 9 ] 3 [ 3 ] [ 7 ] 4 [ 4 ] [ 6 ] [ 9 ] 5 [ 8 ] 6 [ 1 ] [ 2 ] 7 [ 10 ] 8 [ 2 ] 9 [ 1 ] [ 2 ] 10 [ 8 ] [ 10 ] 11 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 9 ] 12 [ 4 ] [ 6 ] [ 9 ] 13 [ 5 ] ![]() ©2004 Association for Computing Machinery |