Text vs. space: Efficient geo-search query processing

Maria Christoforaki, Jinru He, Constantinos Dimopoulos, Alexander Markowetz, Torsten Suel

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Many web search services allow users to constrain text queries to a geographic location (e.g., yoga classes near Santa Monica). Important examples include local search engines such as Google Local and location-based search services for smart phones. Several research groups have studied the efficient execution of queries mixing text and geography; their approaches usually combine inverted lists with a spatial access method such as an R-tree or space-filling curve. In this paper, we take a fresh look at this problem. We feel that previous work has often focused on the spatial aspect at the expense of performance considerations in text processing, such as inverted index access, compression, and caching. We describe new and existing approaches and discuss their different perspectives. We then compare their performance in extensive experiments on large document collections. Our results indicate that a query processor that combines state-of-the-art text processing techniques with a simple coarse-grained spatial structure can outperform existing approaches by up to two orders of magnitude. In fact, even a naive approach that first uses a simple inverted index and then filters out any documents outside the query range outperforms many previous methods.

    Original languageEnglish (US)
    Title of host publicationCIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management
    Pages423-432
    Number of pages10
    DOIs
    StatePublished - 2011
    Event20th ACM Conference on Information and Knowledge Management, CIKM'11 - Glasgow, United Kingdom
    Duration: Oct 24 2011Oct 28 2011

    Other

    Other20th ACM Conference on Information and Knowledge Management, CIKM'11
    CountryUnited Kingdom
    CityGlasgow
    Period10/24/1110/28/11

    Fingerprint

    Query
    Query processing
    Inverted index
    Web search
    Search engine
    Geographic location
    Local search
    Spatial structure
    Expenses
    Filter
    Experiment
    Geography
    Compression
    Google

    Keywords

    • efficient query processing
    • geographic web search engines

    ASJC Scopus subject areas

    • Business, Management and Accounting(all)
    • Decision Sciences(all)

    Cite this

    Christoforaki, M., He, J., Dimopoulos, C., Markowetz, A., & Suel, T. (2011). Text vs. space: Efficient geo-search query processing. In CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management (pp. 423-432) https://doi.org/10.1145/2063576.2063641

    Text vs. space : Efficient geo-search query processing. / Christoforaki, Maria; He, Jinru; Dimopoulos, Constantinos; Markowetz, Alexander; Suel, Torsten.

    CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. 2011. p. 423-432.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Christoforaki, M, He, J, Dimopoulos, C, Markowetz, A & Suel, T 2011, Text vs. space: Efficient geo-search query processing. in CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. pp. 423-432, 20th ACM Conference on Information and Knowledge Management, CIKM'11, Glasgow, United Kingdom, 10/24/11. https://doi.org/10.1145/2063576.2063641
    Christoforaki M, He J, Dimopoulos C, Markowetz A, Suel T. Text vs. space: Efficient geo-search query processing. In CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. 2011. p. 423-432 https://doi.org/10.1145/2063576.2063641
    Christoforaki, Maria ; He, Jinru ; Dimopoulos, Constantinos ; Markowetz, Alexander ; Suel, Torsten. / Text vs. space : Efficient geo-search query processing. CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management. 2011. pp. 423-432
    @inproceedings{74ee028d26ca4c4abaa631057d141f94,
    title = "Text vs. space: Efficient geo-search query processing",
    abstract = "Many web search services allow users to constrain text queries to a geographic location (e.g., yoga classes near Santa Monica). Important examples include local search engines such as Google Local and location-based search services for smart phones. Several research groups have studied the efficient execution of queries mixing text and geography; their approaches usually combine inverted lists with a spatial access method such as an R-tree or space-filling curve. In this paper, we take a fresh look at this problem. We feel that previous work has often focused on the spatial aspect at the expense of performance considerations in text processing, such as inverted index access, compression, and caching. We describe new and existing approaches and discuss their different perspectives. We then compare their performance in extensive experiments on large document collections. Our results indicate that a query processor that combines state-of-the-art text processing techniques with a simple coarse-grained spatial structure can outperform existing approaches by up to two orders of magnitude. In fact, even a naive approach that first uses a simple inverted index and then filters out any documents outside the query range outperforms many previous methods.",
    keywords = "efficient query processing, geographic web search engines",
    author = "Maria Christoforaki and Jinru He and Constantinos Dimopoulos and Alexander Markowetz and Torsten Suel",
    year = "2011",
    doi = "10.1145/2063576.2063641",
    language = "English (US)",
    isbn = "9781450307178",
    pages = "423--432",
    booktitle = "CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management",

    }

    TY - GEN

    T1 - Text vs. space

    T2 - Efficient geo-search query processing

    AU - Christoforaki, Maria

    AU - He, Jinru

    AU - Dimopoulos, Constantinos

    AU - Markowetz, Alexander

    AU - Suel, Torsten

    PY - 2011

    Y1 - 2011

    N2 - Many web search services allow users to constrain text queries to a geographic location (e.g., yoga classes near Santa Monica). Important examples include local search engines such as Google Local and location-based search services for smart phones. Several research groups have studied the efficient execution of queries mixing text and geography; their approaches usually combine inverted lists with a spatial access method such as an R-tree or space-filling curve. In this paper, we take a fresh look at this problem. We feel that previous work has often focused on the spatial aspect at the expense of performance considerations in text processing, such as inverted index access, compression, and caching. We describe new and existing approaches and discuss their different perspectives. We then compare their performance in extensive experiments on large document collections. Our results indicate that a query processor that combines state-of-the-art text processing techniques with a simple coarse-grained spatial structure can outperform existing approaches by up to two orders of magnitude. In fact, even a naive approach that first uses a simple inverted index and then filters out any documents outside the query range outperforms many previous methods.

    AB - Many web search services allow users to constrain text queries to a geographic location (e.g., yoga classes near Santa Monica). Important examples include local search engines such as Google Local and location-based search services for smart phones. Several research groups have studied the efficient execution of queries mixing text and geography; their approaches usually combine inverted lists with a spatial access method such as an R-tree or space-filling curve. In this paper, we take a fresh look at this problem. We feel that previous work has often focused on the spatial aspect at the expense of performance considerations in text processing, such as inverted index access, compression, and caching. We describe new and existing approaches and discuss their different perspectives. We then compare their performance in extensive experiments on large document collections. Our results indicate that a query processor that combines state-of-the-art text processing techniques with a simple coarse-grained spatial structure can outperform existing approaches by up to two orders of magnitude. In fact, even a naive approach that first uses a simple inverted index and then filters out any documents outside the query range outperforms many previous methods.

    KW - efficient query processing

    KW - geographic web search engines

    UR - http://www.scopus.com/inward/record.url?scp=83055191910&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=83055191910&partnerID=8YFLogxK

    U2 - 10.1145/2063576.2063641

    DO - 10.1145/2063576.2063641

    M3 - Conference contribution

    SN - 9781450307178

    SP - 423

    EP - 432

    BT - CIKM'11 - Proceedings of the 2011 ACM International Conference on Information and Knowledge Management

    ER -