Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2006-01

AUTHORS

Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lun Lee

ABSTRACT

Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on the locations of data objects: using some distance heuristics on object locations. The latter is built on a precomputed solution space. Thus, NN queries can be reduced to and processed as simple point queries in this solution space. Both approaches exhibit some disadvantages, especially when employed for wireless data broadcast in mobile computing environments. In this paper, we introduce a new index method, called the grid-partition index, to support NN search in both on-demand access and periodic broadcast modes of mobile computing. The grid-partition index is constructed based on the Voronoi diagram, i.e., the solution space of NN queries. However, it has two distinctive characteristics. First, it divides the solution space into grid cells such that a query point can be efficiently mapped into a grid cell around which the nearest object is located. This significantly reduces the search space. Second, the grid-partition index stores the objects that are potential NNs of any query falling within the cell. The storage of objects, instead of the Voronoi cells, makes the grid-partition index a hybrid of the solution-based and object-based approaches. As a result, it achieves a much more compact representation than the pure solution-based approach and avoids backtracked traversals required in the typical object-based approach, thus realizing the advantages of both approaches. We develop an incremental construction algorithm to address the issue of object update. In addition, we present a cost model to approximate the search cost of different grid partitioning schemes. The performances of the grid-partition index and existing indexes are evaluated using both synthetic and real data. The results show that, overall, the grid-partition index significantly outperforms object-based indexes and solution-based indexes. Furthermore, we extend the grid-partition index to support continuous-nearest-neighbor search. Both algorithms and experimental results are presented. More... »

PAGES

21-39

References to SciGraph publications

  • 2001. K-Nearest Neighbor Search for Moving Query Point in ADVANCES IN SPATIAL AND TEMPORAL DATABASES
  • 2004. Energy-Conserving Air Indexes for Nearest Neighbor Search in ADVANCES IN DATABASE TECHNOLOGY - EDBT 2004
  • 1991-06. Refinements to nearest-neighbor searching ink-dimensional trees in ALGORITHMICA
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00778-004-0146-0

    DOI

    http://dx.doi.org/10.1007/s00778-004-0146-0

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1030967233


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0806", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information Systems", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Singapore Management University", 
              "id": "https://www.grid.ac/institutes/grid.412634.6", 
              "name": [
                "Singapore Management University, 469 Bukit Timah Road, 259756, Singapore"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Zheng", 
            "givenName": "Baihua", 
            "id": "sg:person.011157064001.39", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011157064001.39"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Hong Kong Baptist University", 
              "id": "https://www.grid.ac/institutes/grid.221309.b", 
              "name": [
                "Hong Kong Baptist University, Kowloon Tong, Hong Kong"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Xu", 
            "givenName": "Jianliang", 
            "id": "sg:person.015640040131.15", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015640040131.15"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Pennsylvania State University", 
              "id": "https://www.grid.ac/institutes/grid.29857.31", 
              "name": [
                "The Penn State University, 16802, University Park, PA, USA"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Lee", 
            "givenName": "Wang-Chien", 
            "id": "sg:person.010527727731.13", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010527727731.13"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Hong Kong University of Science and Technology", 
              "id": "https://www.grid.ac/institutes/grid.24515.37", 
              "name": [
                "Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Lee", 
            "givenName": "Dik Lun", 
            "id": "sg:person.012720251331.03", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012720251331.03"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/978-3-540-24741-8_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005748595", 
              "https://doi.org/10.1007/978-3-540-24741-8_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-540-24741-8_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005748595", 
              "https://doi.org/10.1007/978-3-540-24741-8_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/223784.223794", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011637299"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01759061", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011929584", 
              "https://doi.org/10.1007/bf01759061"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bf01759061", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1011929584", 
              "https://doi.org/10.1007/bf01759061"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/290593.290596", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012868107"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/564691.564730", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1016650756"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/b978-155860869-6/50033-0", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1021234329"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/109648.109673", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1025877985"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/602259.602266", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1042817816"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/320248.320255", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1049019897"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/348.318586", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1049066804"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-47724-1_5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052596670", 
              "https://doi.org/10.1007/3-540-47724-1_5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/69.599926", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061213590"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/69.842249", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061213806"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/mprv.2002.1037724", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061418121"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icde.2001.914864", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1093942855"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icde.1997.582015", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1094226347"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icde.1999.754931", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095361826"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icde.2000.839402", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095628836"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2006-01", 
        "datePublishedReg": "2006-01-01", 
        "description": "Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on the locations of data objects: using some distance heuristics on object locations. The latter is built on a precomputed solution space. Thus, NN queries can be reduced to and processed as simple point queries in this solution space. Both approaches exhibit some disadvantages, especially when employed for wireless data broadcast in mobile computing environments. In this paper, we introduce a new index method, called the grid-partition index, to support NN search in both on-demand access and periodic broadcast modes of mobile computing. The grid-partition index is constructed based on the Voronoi diagram, i.e., the solution space of NN queries. However, it has two distinctive characteristics. First, it divides the solution space into grid cells such that a query point can be efficiently mapped into a grid cell around which the nearest object is located. This significantly reduces the search space. Second, the grid-partition index stores the objects that are potential NNs of any query falling within the cell. The storage of objects, instead of the Voronoi cells, makes the grid-partition index a hybrid of the solution-based and object-based approaches. As a result, it achieves a much more compact representation than the pure solution-based approach and avoids backtracked traversals required in the typical object-based approach, thus realizing the advantages of both approaches. We develop an incremental construction algorithm to address the issue of object update. In addition, we present a cost model to approximate the search cost of different grid partitioning schemes. The performances of the grid-partition index and existing indexes are evaluated using both synthetic and real data. The results show that, overall, the grid-partition index significantly outperforms object-based indexes and solution-based indexes. Furthermore, we extend the grid-partition index to support continuous-nearest-neighbor search. Both algorithms and experimental results are presented.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s00778-004-0146-0", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1044889", 
            "issn": [
              "1066-8888", 
              "0949-877X"
            ], 
            "name": "The VLDB Journal", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "1", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "15"
          }
        ], 
        "name": "Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services", 
        "pagination": "21-39", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "9386b28d1c4b94e3f170b7db872f6383b1eebacb5cc14c8c37dbc25da6835dc7"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00778-004-0146-0"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1030967233"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00778-004-0146-0", 
          "https://app.dimensions.ai/details/publication/pub.1030967233"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-11T14:25", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000373_0000000373/records_13068_00000001.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1007/s00778-004-0146-0"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s00778-004-0146-0'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s00778-004-0146-0'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00778-004-0146-0'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00778-004-0146-0'


     

    This table displays all metadata directly associated to this object as RDF triples.

    148 TRIPLES      21 PREDICATES      45 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00778-004-0146-0 schema:about anzsrc-for:08
    2 anzsrc-for:0806
    3 schema:author N1feee279d36b4b39af6c31361d79ba93
    4 schema:citation sg:pub.10.1007/3-540-47724-1_5
    5 sg:pub.10.1007/978-3-540-24741-8_5
    6 sg:pub.10.1007/bf01759061
    7 https://doi.org/10.1016/b978-155860869-6/50033-0
    8 https://doi.org/10.1109/69.599926
    9 https://doi.org/10.1109/69.842249
    10 https://doi.org/10.1109/icde.1997.582015
    11 https://doi.org/10.1109/icde.1999.754931
    12 https://doi.org/10.1109/icde.2000.839402
    13 https://doi.org/10.1109/icde.2001.914864
    14 https://doi.org/10.1109/mprv.2002.1037724
    15 https://doi.org/10.1145/109648.109673
    16 https://doi.org/10.1145/223784.223794
    17 https://doi.org/10.1145/290593.290596
    18 https://doi.org/10.1145/320248.320255
    19 https://doi.org/10.1145/348.318586
    20 https://doi.org/10.1145/564691.564730
    21 https://doi.org/10.1145/602259.602266
    22 schema:datePublished 2006-01
    23 schema:datePublishedReg 2006-01-01
    24 schema:description Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on the locations of data objects: using some distance heuristics on object locations. The latter is built on a precomputed solution space. Thus, NN queries can be reduced to and processed as simple point queries in this solution space. Both approaches exhibit some disadvantages, especially when employed for wireless data broadcast in mobile computing environments. In this paper, we introduce a new index method, called the grid-partition index, to support NN search in both on-demand access and periodic broadcast modes of mobile computing. The grid-partition index is constructed based on the Voronoi diagram, i.e., the solution space of NN queries. However, it has two distinctive characteristics. First, it divides the solution space into grid cells such that a query point can be efficiently mapped into a grid cell around which the nearest object is located. This significantly reduces the search space. Second, the grid-partition index stores the objects that are potential NNs of any query falling within the cell. The storage of objects, instead of the Voronoi cells, makes the grid-partition index a hybrid of the solution-based and object-based approaches. As a result, it achieves a much more compact representation than the pure solution-based approach and avoids backtracked traversals required in the typical object-based approach, thus realizing the advantages of both approaches. We develop an incremental construction algorithm to address the issue of object update. In addition, we present a cost model to approximate the search cost of different grid partitioning schemes. The performances of the grid-partition index and existing indexes are evaluated using both synthetic and real data. The results show that, overall, the grid-partition index significantly outperforms object-based indexes and solution-based indexes. Furthermore, we extend the grid-partition index to support continuous-nearest-neighbor search. Both algorithms and experimental results are presented.
    25 schema:genre research_article
    26 schema:inLanguage en
    27 schema:isAccessibleForFree false
    28 schema:isPartOf N291913341f67412289972b362fd23e0a
    29 N890303713b9344cfa7370695a49b4232
    30 sg:journal.1044889
    31 schema:name Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
    32 schema:pagination 21-39
    33 schema:productId N7a549689b2504934869b784905663847
    34 N80eeec1ec5154bf98972440a7bc9aebe
    35 Ne257897676f5491eab195224b6162d06
    36 schema:sameAs https://app.dimensions.ai/details/publication/pub.1030967233
    37 https://doi.org/10.1007/s00778-004-0146-0
    38 schema:sdDatePublished 2019-04-11T14:25
    39 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    40 schema:sdPublisher N0ba4224ff6954d5599ea974539832294
    41 schema:url http://link.springer.com/10.1007/s00778-004-0146-0
    42 sgo:license sg:explorer/license/
    43 sgo:sdDataset articles
    44 rdf:type schema:ScholarlyArticle
    45 N0ba4224ff6954d5599ea974539832294 schema:name Springer Nature - SN SciGraph project
    46 rdf:type schema:Organization
    47 N153fd8a3e51c46c3a8ba0adf60dc5acf rdf:first sg:person.015640040131.15
    48 rdf:rest Nf5501ac6bde646518cf2d5aa1dff473a
    49 N1feee279d36b4b39af6c31361d79ba93 rdf:first sg:person.011157064001.39
    50 rdf:rest N153fd8a3e51c46c3a8ba0adf60dc5acf
    51 N291913341f67412289972b362fd23e0a schema:issueNumber 1
    52 rdf:type schema:PublicationIssue
    53 N7a549689b2504934869b784905663847 schema:name doi
    54 schema:value 10.1007/s00778-004-0146-0
    55 rdf:type schema:PropertyValue
    56 N80eeec1ec5154bf98972440a7bc9aebe schema:name dimensions_id
    57 schema:value pub.1030967233
    58 rdf:type schema:PropertyValue
    59 N890303713b9344cfa7370695a49b4232 schema:volumeNumber 15
    60 rdf:type schema:PublicationVolume
    61 Nc65983edba8c4392b7bf4643ede826d8 rdf:first sg:person.012720251331.03
    62 rdf:rest rdf:nil
    63 Ne257897676f5491eab195224b6162d06 schema:name readcube_id
    64 schema:value 9386b28d1c4b94e3f170b7db872f6383b1eebacb5cc14c8c37dbc25da6835dc7
    65 rdf:type schema:PropertyValue
    66 Nf5501ac6bde646518cf2d5aa1dff473a rdf:first sg:person.010527727731.13
    67 rdf:rest Nc65983edba8c4392b7bf4643ede826d8
    68 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    69 schema:name Information and Computing Sciences
    70 rdf:type schema:DefinedTerm
    71 anzsrc-for:0806 schema:inDefinedTermSet anzsrc-for:
    72 schema:name Information Systems
    73 rdf:type schema:DefinedTerm
    74 sg:journal.1044889 schema:issn 0949-877X
    75 1066-8888
    76 schema:name The VLDB Journal
    77 rdf:type schema:Periodical
    78 sg:person.010527727731.13 schema:affiliation https://www.grid.ac/institutes/grid.29857.31
    79 schema:familyName Lee
    80 schema:givenName Wang-Chien
    81 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010527727731.13
    82 rdf:type schema:Person
    83 sg:person.011157064001.39 schema:affiliation https://www.grid.ac/institutes/grid.412634.6
    84 schema:familyName Zheng
    85 schema:givenName Baihua
    86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011157064001.39
    87 rdf:type schema:Person
    88 sg:person.012720251331.03 schema:affiliation https://www.grid.ac/institutes/grid.24515.37
    89 schema:familyName Lee
    90 schema:givenName Dik Lun
    91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012720251331.03
    92 rdf:type schema:Person
    93 sg:person.015640040131.15 schema:affiliation https://www.grid.ac/institutes/grid.221309.b
    94 schema:familyName Xu
    95 schema:givenName Jianliang
    96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015640040131.15
    97 rdf:type schema:Person
    98 sg:pub.10.1007/3-540-47724-1_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1052596670
    99 https://doi.org/10.1007/3-540-47724-1_5
    100 rdf:type schema:CreativeWork
    101 sg:pub.10.1007/978-3-540-24741-8_5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005748595
    102 https://doi.org/10.1007/978-3-540-24741-8_5
    103 rdf:type schema:CreativeWork
    104 sg:pub.10.1007/bf01759061 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011929584
    105 https://doi.org/10.1007/bf01759061
    106 rdf:type schema:CreativeWork
    107 https://doi.org/10.1016/b978-155860869-6/50033-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1021234329
    108 rdf:type schema:CreativeWork
    109 https://doi.org/10.1109/69.599926 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061213590
    110 rdf:type schema:CreativeWork
    111 https://doi.org/10.1109/69.842249 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061213806
    112 rdf:type schema:CreativeWork
    113 https://doi.org/10.1109/icde.1997.582015 schema:sameAs https://app.dimensions.ai/details/publication/pub.1094226347
    114 rdf:type schema:CreativeWork
    115 https://doi.org/10.1109/icde.1999.754931 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095361826
    116 rdf:type schema:CreativeWork
    117 https://doi.org/10.1109/icde.2000.839402 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095628836
    118 rdf:type schema:CreativeWork
    119 https://doi.org/10.1109/icde.2001.914864 schema:sameAs https://app.dimensions.ai/details/publication/pub.1093942855
    120 rdf:type schema:CreativeWork
    121 https://doi.org/10.1109/mprv.2002.1037724 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061418121
    122 rdf:type schema:CreativeWork
    123 https://doi.org/10.1145/109648.109673 schema:sameAs https://app.dimensions.ai/details/publication/pub.1025877985
    124 rdf:type schema:CreativeWork
    125 https://doi.org/10.1145/223784.223794 schema:sameAs https://app.dimensions.ai/details/publication/pub.1011637299
    126 rdf:type schema:CreativeWork
    127 https://doi.org/10.1145/290593.290596 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012868107
    128 rdf:type schema:CreativeWork
    129 https://doi.org/10.1145/320248.320255 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049019897
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1145/348.318586 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049066804
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1145/564691.564730 schema:sameAs https://app.dimensions.ai/details/publication/pub.1016650756
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1145/602259.602266 schema:sameAs https://app.dimensions.ai/details/publication/pub.1042817816
    136 rdf:type schema:CreativeWork
    137 https://www.grid.ac/institutes/grid.221309.b schema:alternateName Hong Kong Baptist University
    138 schema:name Hong Kong Baptist University, Kowloon Tong, Hong Kong
    139 rdf:type schema:Organization
    140 https://www.grid.ac/institutes/grid.24515.37 schema:alternateName Hong Kong University of Science and Technology
    141 schema:name Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong
    142 rdf:type schema:Organization
    143 https://www.grid.ac/institutes/grid.29857.31 schema:alternateName Pennsylvania State University
    144 schema:name The Penn State University, 16802, University Park, PA, USA
    145 rdf:type schema:Organization
    146 https://www.grid.ac/institutes/grid.412634.6 schema:alternateName Singapore Management University
    147 schema:name Singapore Management University, 469 Bukit Timah Road, 259756, Singapore
    148 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...