Keyword search in spatial databases: Towards searching by document

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 688-699

  Zhang, Dongxiang ^a   Chee, Yeow Meng ^b   Mondal, Anirban ^c   Tung, Anthony K H ^a   Kitsuregawa, Masaru ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APRIORI; DESCRIPTIVE INFORMATION; KEYWORD QUERIES; KEYWORD SEARCH; NEW INDICES; PERFORMANCE STUDY; QUERY RESPONSE TIME; SEARCH SPACES; SEARCH STRATEGIES; SPATIAL DATABASE; SPATIAL OBJECTS;

EID: 67649643445     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.77     Document Type: Conference Paper

References (29)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pages 487-499, 1994.
2. S. Agrawal, S. Chaudhuri, and G. Das. DBXplorer: A system for keyword-based search over relational databases. In Proceedings of ICDE, 2002.
3. W. Aref, D. Barbara, S. Johnson, and S. Mehrotra. Efficient processing of proximity queries for large databases. Proc. ICDE, pages 147-154, 1995.
4. W. Aref and H. Samet. Efficient processing of window queries in the pyramid data structure. Proc. PODS, pages 265-272, 1990.
5. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. Proc. SIGMOD, pages 322-331, 1990.
6. G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using banks. In Proceedings of ICDE, 2002.
7. T. Brinkhoff, H. Kriegel, and B. Seeger. Efficient processing of spatial joins using R-trees. Proc. SIGMOD, pages 237-246, 1993.
8. G. Cong, B. Ooi, K. Tan, and A. Tung. Go green: Recycle and reuse frequent patterns. In Data Engineering, 2004. Proceedings. 20th International Conference on, pages 128-139.
9. A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos. Closest pair queries in spatial databases. Proc. SIGMOD, pages 189-200, 2000.
10. I. D. Felipe, V. Hristidis, and N. Rishe. Keyword search on spatial databases. In Proc. ICDE International Conference on Data Engineering,2008.
11. A. Guttman. R-trees: A dynamic index structure for spatial searching. Proc. SIGMOD, pages 47-57, 1984.
12. R. Hariharan, B. Hore, C. Li, and S. Mehrotra. Processing spatialkeyword (sk) queries in geographic information retrieval (gir) systems. In SSDBM, page 16, 2007.
13. G. Hjaltason and H. Samet. Incremental distance join algorithms for spatial databases. Proc. SIGMOD, pages 237-248, 1998.
14. H. Jagadish, R. Ng, B. Ooi, and A. Tung. ItCompress: An Iterative Semantic Compression Algorithm. In Proceedings of the 20th International Conference on Data Engineering (ICDE04), volume 1063, pages 20-00.
15. H. V. Jagadish, N. Koudas, and D. Srivastava. On effective multidimensional indexing for strings. Proc. SIGMOD, pages 403-414, 2000.
16. K. Koperski and J. Han. Discovery of spatial association rules in geographic information databases. Proc. SSD, pages 47-66, 1995.
17. N. Mamoulis and D. Papadias. Multiway spatial joins. Proc. TODS, 26(4):424-475, 2001.
18. B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer. Towards an analysis of range query performance in spatial data structures. In PODS, pages 214-221, New York, NY, USA, 1993. ACM.
19. D. Papadias and D. Arkoumanis. Approximate processing of multiway spatial joins in very large databases. Proc. EDBT, pages 179-196, 2002.
20. D. Papadias, N. Mamoulis, and B. Delis. Algorithms for querying by spatial structure. Proc. VLDB, pages 546-557, 1998.
21. D. Papadias, N. Mamoulis, and Y. Theodoridis. Processing and optimization of multiway spatial joins using R-trees. Proc. PODS, pages 44-55, 1999.
22. D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis. Group nearest neighbor queries. Proc. ICDE, pages 301-312, 2004.
23. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. Proc. SIGMOD, pages 71-79, 1995.
24. S. Shekhar and Y. Huang. Discovering spatial co-location patterns: A summary of results. Proc. SSTD, pages 236-256, 2001.
25. H. Shin, B. Moon, and S. Lee. Adaptive multi-stage distance join processing. Proc. SIGMOD, pages 343-354, 2000.
26. Q. Vu, B. Ooi, D. Papadias, and A. Tung. A graph method for keywordbased selection of the top-K databases. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 915-926. ACM New York, NY, USA, 2008.
27. N. Wang, S. Parthasarathy, K. Tan, and A. Tung. CSV: Visualizing and mining cohesive subgraphs. In Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pages 445-458. ACM New York, NY, USA, 2008.
28. B. Yu, G. Li, K. Sollins, and A. K. H. Tung. Effective keyword-based selection of relational databases. In Proceedings of SIGMOD, 2007.
29. X. Zhang, N. Mamoulis, D. W. Cheung, and Y. Shou. Fast mining of spatial collocations. Proc. KDD, pages 384-393, 2004.