Range searching in categorical data: Colored range searching on grid

Pankaj K. Agarwal, Sathish Govindarajan, Shanmugavelayutham Muthukrishnan

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

    Abstract

    Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are partitioned into categories and a query asks for reporting the set of categories of objects that intersect a query object. Moreover in many such applications, objects lie on a grid. We abstract the category of an object by associating a color with each object. In this paper, we present efficient data structures for solving the colored range-searching and colored point-enclosure problem on U × U grid. Our data structures use near- linear space and answer a query in 0(log log U + k)time, where k is the output size. As far as we know, this is the first result on colored range-searching for objects lying on a grid.

    Original languageEnglish (US)
    Title of host publicationAlgorithms - ESA 2002 - 10th Annual European Symposium, Proceedings
    EditorsRolf Möhring, Rajeev Raman
    PublisherSpringer-Verlag
    Pages17-28
    Number of pages12
    ISBN (Electronic)3540441808, 9783540441809
    StatePublished - Jan 1 2002
    Event10th Annual European Symposium on Algorithms, ESA 2002 - Rome, Italy
    Duration: Sep 17 2002Sep 21 2002

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume2461
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other10th Annual European Symposium on Algorithms, ESA 2002
    CountryItaly
    CityRome
    Period9/17/029/21/02

    Fingerprint

    Range Searching
    Nominal or categorical data
    Grid
    Data structures
    Computational geometry
    Network routing
    Enclosures
    Query
    Color
    Intersect
    Data Structures
    Object
    Spatial Database
    Range Query
    Geometric object
    Computational Geometry
    Enclosure
    Linear Space
    Routing

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Agarwal, P. K., Govindarajan, S., & Muthukrishnan, S. (2002). Range searching in categorical data: Colored range searching on grid. In R. Möhring, & R. Raman (Eds.), Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings (pp. 17-28). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2461). Springer-Verlag.

    Range searching in categorical data : Colored range searching on grid. / Agarwal, Pankaj K.; Govindarajan, Sathish; Muthukrishnan, Shanmugavelayutham.

    Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. ed. / Rolf Möhring; Rajeev Raman. Springer-Verlag, 2002. p. 17-28 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2461).

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

    Agarwal, PK, Govindarajan, S & Muthukrishnan, S 2002, Range searching in categorical data: Colored range searching on grid. in R Möhring & R Raman (eds), Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461, Springer-Verlag, pp. 17-28, 10th Annual European Symposium on Algorithms, ESA 2002, Rome, Italy, 9/17/02.
    Agarwal PK, Govindarajan S, Muthukrishnan S. Range searching in categorical data: Colored range searching on grid. In Möhring R, Raman R, editors, Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. Springer-Verlag. 2002. p. 17-28. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Agarwal, Pankaj K. ; Govindarajan, Sathish ; Muthukrishnan, Shanmugavelayutham. / Range searching in categorical data : Colored range searching on grid. Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings. editor / Rolf Möhring ; Rajeev Raman. Springer-Verlag, 2002. pp. 17-28 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{9f0b4d99afab4fd2992eb0d8c572c35a,
    title = "Range searching in categorical data: Colored range searching on grid",
    abstract = "Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are partitioned into categories and a query asks for reporting the set of categories of objects that intersect a query object. Moreover in many such applications, objects lie on a grid. We abstract the category of an object by associating a color with each object. In this paper, we present efficient data structures for solving the colored range-searching and colored point-enclosure problem on U × U grid. Our data structures use near- linear space and answer a query in 0(log log U + k)time, where k is the output size. As far as we know, this is the first result on colored range-searching for objects lying on a grid.",
    author = "Agarwal, {Pankaj K.} and Sathish Govindarajan and Shanmugavelayutham Muthukrishnan",
    year = "2002",
    month = "1",
    day = "1",
    language = "English (US)",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer-Verlag",
    pages = "17--28",
    editor = "Rolf M{\"o}hring and Rajeev Raman",
    booktitle = "Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings",

    }

    TY - GEN

    T1 - Range searching in categorical data

    T2 - Colored range searching on grid

    AU - Agarwal, Pankaj K.

    AU - Govindarajan, Sathish

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2002/1/1

    Y1 - 2002/1/1

    N2 - Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are partitioned into categories and a query asks for reporting the set of categories of objects that intersect a query object. Moreover in many such applications, objects lie on a grid. We abstract the category of an object by associating a color with each object. In this paper, we present efficient data structures for solving the colored range-searching and colored point-enclosure problem on U × U grid. Our data structures use near- linear space and answer a query in 0(log log U + k)time, where k is the output size. As far as we know, this is the first result on colored range-searching for objects lying on a grid.

    AB - Range searching, a fundamental problem in numerous applications areas, has been widely studied in computational geometry and spatial databases. Given a set of geometric objects, a typical range query asks for reporting all the objects that intersect a query object. However in many applications, including databases and network routing, input objects are partitioned into categories and a query asks for reporting the set of categories of objects that intersect a query object. Moreover in many such applications, objects lie on a grid. We abstract the category of an object by associating a color with each object. In this paper, we present efficient data structures for solving the colored range-searching and colored point-enclosure problem on U × U grid. Our data structures use near- linear space and answer a query in 0(log log U + k)time, where k is the output size. As far as we know, this is the first result on colored range-searching for objects lying on a grid.

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

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

    M3 - Conference contribution

    AN - SCOPUS:84938097887

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 17

    EP - 28

    BT - Algorithms - ESA 2002 - 10th Annual European Symposium, Proceedings

    A2 - Möhring, Rolf

    A2 - Raman, Rajeev

    PB - Springer-Verlag

    ER -