[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

In-Memory Processing for Nearest User-Specified Group Search

  • Conference paper
  • First Online:
Advances in Computer Science and Ubiquitous Computing

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 373))

Abstract

This paper presents a nearest user-specified group (NUG) search which called a clustered NN problem. Given a set of data points P and a query point q, NUG search finds the nearest subset cP (|c| ≥ k) from q (called user-specified group) that satisfies given conditions. Motivated by the brute-force approach for NUG search requires O(|P|2) computational cost, we propose a faster algorithm to handle NUG problem with in-memory processing. We first define clustered objects above k as a user-specified group and the NUG search problem. Moreover, the proposed solution converts a NUG search problem to a graph formulation problem, and reduces processing cost with geometric-based heuristics. Our experimental results show that the efficiency and effectiveness of our proposed approach outperforms the conventional one.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 103.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 129.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
GBP 129.99
Price includes VAT (United Kingdom)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Roussopoulos, N., Kelly, S., Vincent, F.: Nearest neighbor queries. In: Proc. ACM SIGMOD (1995)

    Google Scholar 

  2. Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: Proc. ACM SIGMOD (2000)

    Google Scholar 

  3. Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: Proc. ICDE (2004)

    Google Scholar 

  4. Zhang, D., Chan, C.Y., Tan, K.L.: Nearest group queries. In: SSDBM (2013)

    Google Scholar 

  5. Choi, D.W., Chung, C.W.: Nearest neighborhood search in spatial databases. In: ICDE (2015)

    Google Scholar 

  6. Spatial Data Generator by Yannis Theodoridis

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Soon-Young Jung .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media Singapore

About this paper

Cite this paper

Jang, HJ., Choi, WS., Hyun, KS., Lim, T., Jung, SY., Chung, J. (2015). In-Memory Processing for Nearest User-Specified Group Search. In: Park, DS., Chao, HC., Jeong, YS., Park, J. (eds) Advances in Computer Science and Ubiquitous Computing. Lecture Notes in Electrical Engineering, vol 373. Springer, Singapore. https://doi.org/10.1007/978-981-10-0281-6_112

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0281-6_112

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0280-9

  • Online ISBN: 978-981-10-0281-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics