Distributed incomplete pattern matching via a novel Weighted Bloom Filter

Siyuan Liu, Lei Kang, Lei Chen, Lionel Ni

Research output: Contribution to conferencePaper

6 Citations (Scopus)

Abstract

In this paper, we first propose a very interesting and practical problem, pattern matching in a distributed mobile environment. Pattern matching is a well-known problem and extensive research has been conducted for performing effective and efficient search. However, previous proposed approaches assume that data are centrally stored, which is not the case in a mobile environment (e.g., mobile phone networks), where one person's pattern could be separately stored in a number of different stations, and such a local pattern is incomplete compared with the global pattern. A simple solution to pattern matching over a mobile environment is to collect all the data distributed in base stations to a data center and conduct pattern matching at the data center afterwards. Clearly, such a simple solution will raise huge amount of communication traffic, which could cause the communication bottleneck brought by the limited wireless bandwidth to be even worse. Therefore, a communication efficient and search effective solution is necessary. In our work, we present a novel solution which is based on our well-designed Weighted Bloom Filter (WBF), called, Distributed Incomplete pattern matching (DI-matching), to find target patterns over a distributed mobile environment. Specifically, to save communication cost and ensure pattern matching in distributed incomplete patterns, we use WBF to encode a query pattern and disseminate the encoded data to each base station. Each base station conducts a local pattern search according to the received WBF. Only qualified IDs and corresponding weights in each base station are sent to the data center for aggregation and verification. Through extensive empirical experiments on a real city-scale mobile networks data set, we demonstrate the effectiveness and efficiency of our proposed solutions.

Original languageEnglish (US)
Pages122-131
Number of pages10
DOIs
StatePublished - Oct 5 2012
Event32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012 - Macau, China
Duration: Jun 18 2012Jun 21 2012

Other

Other32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012
CountryChina
CityMacau
Period6/18/126/21/12

Fingerprint

Pattern matching
Base stations
Communication
Mobile phones
Telecommunication traffic
Wireless networks
Agglomeration
Bandwidth
Costs
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Liu, S., Kang, L., Chen, L., & Ni, L. (2012). Distributed incomplete pattern matching via a novel Weighted Bloom Filter. 122-131. Paper presented at 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012, Macau, China. https://doi.org/10.1109/ICDCS.2012.24
Liu, Siyuan ; Kang, Lei ; Chen, Lei ; Ni, Lionel. / Distributed incomplete pattern matching via a novel Weighted Bloom Filter. Paper presented at 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012, Macau, China.10 p.
@conference{28711df0047f48f0b659f15054a6af17,
title = "Distributed incomplete pattern matching via a novel Weighted Bloom Filter",
abstract = "In this paper, we first propose a very interesting and practical problem, pattern matching in a distributed mobile environment. Pattern matching is a well-known problem and extensive research has been conducted for performing effective and efficient search. However, previous proposed approaches assume that data are centrally stored, which is not the case in a mobile environment (e.g., mobile phone networks), where one person's pattern could be separately stored in a number of different stations, and such a local pattern is incomplete compared with the global pattern. A simple solution to pattern matching over a mobile environment is to collect all the data distributed in base stations to a data center and conduct pattern matching at the data center afterwards. Clearly, such a simple solution will raise huge amount of communication traffic, which could cause the communication bottleneck brought by the limited wireless bandwidth to be even worse. Therefore, a communication efficient and search effective solution is necessary. In our work, we present a novel solution which is based on our well-designed Weighted Bloom Filter (WBF), called, Distributed Incomplete pattern matching (DI-matching), to find target patterns over a distributed mobile environment. Specifically, to save communication cost and ensure pattern matching in distributed incomplete patterns, we use WBF to encode a query pattern and disseminate the encoded data to each base station. Each base station conducts a local pattern search according to the received WBF. Only qualified IDs and corresponding weights in each base station are sent to the data center for aggregation and verification. Through extensive empirical experiments on a real city-scale mobile networks data set, we demonstrate the effectiveness and efficiency of our proposed solutions.",
author = "Siyuan Liu and Lei Kang and Lei Chen and Lionel Ni",
year = "2012",
month = "10",
day = "5",
doi = "10.1109/ICDCS.2012.24",
language = "English (US)",
pages = "122--131",
note = "32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012 ; Conference date: 18-06-2012 Through 21-06-2012",

}

Liu, S, Kang, L, Chen, L & Ni, L 2012, 'Distributed incomplete pattern matching via a novel Weighted Bloom Filter' Paper presented at 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012, Macau, China, 6/18/12 - 6/21/12, pp. 122-131. https://doi.org/10.1109/ICDCS.2012.24

Distributed incomplete pattern matching via a novel Weighted Bloom Filter. / Liu, Siyuan; Kang, Lei; Chen, Lei; Ni, Lionel.

2012. 122-131 Paper presented at 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012, Macau, China.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Distributed incomplete pattern matching via a novel Weighted Bloom Filter

AU - Liu, Siyuan

AU - Kang, Lei

AU - Chen, Lei

AU - Ni, Lionel

PY - 2012/10/5

Y1 - 2012/10/5

N2 - In this paper, we first propose a very interesting and practical problem, pattern matching in a distributed mobile environment. Pattern matching is a well-known problem and extensive research has been conducted for performing effective and efficient search. However, previous proposed approaches assume that data are centrally stored, which is not the case in a mobile environment (e.g., mobile phone networks), where one person's pattern could be separately stored in a number of different stations, and such a local pattern is incomplete compared with the global pattern. A simple solution to pattern matching over a mobile environment is to collect all the data distributed in base stations to a data center and conduct pattern matching at the data center afterwards. Clearly, such a simple solution will raise huge amount of communication traffic, which could cause the communication bottleneck brought by the limited wireless bandwidth to be even worse. Therefore, a communication efficient and search effective solution is necessary. In our work, we present a novel solution which is based on our well-designed Weighted Bloom Filter (WBF), called, Distributed Incomplete pattern matching (DI-matching), to find target patterns over a distributed mobile environment. Specifically, to save communication cost and ensure pattern matching in distributed incomplete patterns, we use WBF to encode a query pattern and disseminate the encoded data to each base station. Each base station conducts a local pattern search according to the received WBF. Only qualified IDs and corresponding weights in each base station are sent to the data center for aggregation and verification. Through extensive empirical experiments on a real city-scale mobile networks data set, we demonstrate the effectiveness and efficiency of our proposed solutions.

AB - In this paper, we first propose a very interesting and practical problem, pattern matching in a distributed mobile environment. Pattern matching is a well-known problem and extensive research has been conducted for performing effective and efficient search. However, previous proposed approaches assume that data are centrally stored, which is not the case in a mobile environment (e.g., mobile phone networks), where one person's pattern could be separately stored in a number of different stations, and such a local pattern is incomplete compared with the global pattern. A simple solution to pattern matching over a mobile environment is to collect all the data distributed in base stations to a data center and conduct pattern matching at the data center afterwards. Clearly, such a simple solution will raise huge amount of communication traffic, which could cause the communication bottleneck brought by the limited wireless bandwidth to be even worse. Therefore, a communication efficient and search effective solution is necessary. In our work, we present a novel solution which is based on our well-designed Weighted Bloom Filter (WBF), called, Distributed Incomplete pattern matching (DI-matching), to find target patterns over a distributed mobile environment. Specifically, to save communication cost and ensure pattern matching in distributed incomplete patterns, we use WBF to encode a query pattern and disseminate the encoded data to each base station. Each base station conducts a local pattern search according to the received WBF. Only qualified IDs and corresponding weights in each base station are sent to the data center for aggregation and verification. Through extensive empirical experiments on a real city-scale mobile networks data set, we demonstrate the effectiveness and efficiency of our proposed solutions.

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

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

U2 - 10.1109/ICDCS.2012.24

DO - 10.1109/ICDCS.2012.24

M3 - Paper

SP - 122

EP - 131

ER -

Liu S, Kang L, Chen L, Ni L. Distributed incomplete pattern matching via a novel Weighted Bloom Filter. 2012. Paper presented at 32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012, Macau, China. https://doi.org/10.1109/ICDCS.2012.24