Skip to content
/ cBiK Public

cBiK is a compact data structure to solve spatio-textual queries (Boolean kNN, Ranked kNN and Range Searching).

Notifications You must be signed in to change notification settings

csanjuanc/cBiK

Repository files navigation

cBiK (Compact Bitmaps and Implicit KD-Tree)

Compact data structure to solve spatio-textual queries (Boolean kNN, Ranked kNN and Range Searching). The main file has different instructions to make the calls both to build the index and to execute the queries found in the Build_cBiK file.

The datasets to be tested must have the following format

ID ID Latitude Longitude Keywords, for example:

  • 1 1 26.353048008480023 -80.14893944389951 Barnes Noble Cafe Coffee Shop Coffee
  • 2 2 41.198486328125 36.720489501953125 Efor Arcade
  • 3 3 -6.2474358618473085 106.92876179761407 Kampus Kelapa Dua College Administrative Building Administrative
  • 4 4 25.536826784689794 -103.45327377319336 Cimaco Department Store Department

The queries format to kNN:

Latitude Longitude Keywords

  • 27.60043156821203 -89.82445466748851 Tucuruvi
  • 28.93397095670383 44.05666482108714 Adanali
  • 31.94235423517235 -68.08543093424582 Raks

The queries format to Range Searching:

Latitude1 Longitude1 Latitude2 Longitude2 Keywords

  • 14.3956825620347 120.9119237743221 14.45925975974265 120.9775720752873 Imus Edwin Cavite

About

cBiK is a compact data structure to solve spatio-textual queries (Boolean kNN, Ranked kNN and Range Searching).

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published