The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January/February (2012 vol.16)
pp: 34-42
Christian von der Weth , Digital Enterprise Research Institute
Anwitaman Datta , Nanyang Technological University
ABSTRACT
<p>Distributed NoSQL systems aim to provide high availability for large volumes of data but lack the inherent support of complex queries often required by overlying applications. Common solutions based on inverted lists for single terms perform poorly in large-scale distributed settings. The authors thus propose a multiterm indexing technique that can store the inverted lists of combinations of terms. A query-driven mechanism adaptively stores popular term combinations derived from the recent query history. Experiments show that this approach reduces the overall bandwidth consumption by half, significantly improving the NoSQL system's capacity and response time with only marginal overhead in terms of additional, but cheaper, required (storage) resources.</p>
INDEX TERMS
NoSQL, key-value stores, multiterm query, caching
CITATION
Christian von der Weth, Anwitaman Datta, "Multiterm Keyword Search in NoSQL Systems", IEEE Internet Computing, vol.16, no. 1, pp. 34-42, January/February 2012, doi:10.1109/MIC.2011.140
REFERENCES
1. G. DeCandia et al., "Dynamo: Amazon's Highly Available Key-Value Store," Proc. ACM SIGOPS Symp. Operating Systems Principles (SOSP 07), vol. 41, ACM Press, 2007, pp. 205–220.
2. A. Lakshman and P. Malik, "Cassandra: Structured Storage System on a P2P Network," Proc. Symp. Principles of Distributed Computing (PODC 09), ACM Press, 2009, p. 5.
3. F. Chang et al., "BigTable: A Distributed Storage System for Structured Data," Proc. Symp. Operating Systems Design and Implementation (OSDI 06), Usenix Assoc., 2006, pp. 205–218.
4. B.F. Cooper et al., "PNUTS: Yahoo!'s Hosted Data Serving Platform," Proc. VLDB Endowment (PVLDB 08), vol. 1, no. 2, 2008, pp. 1277–1288.
5. M.K. Aguilera, W.M. Golab, and M.A. Shah, "A Practical Scalable Distributed B-Tree," Proc. VLDB Endowment (PVLDB 08), vol. 1, no. 1, 2008, pp. 598–609.
6. S. Ramabhadran et al., "Brief Announcement: Prefix Hash Tree," Proc. Symp. Principles of Distributed Computing (PODC 04), ACM Press, 2004, p. 368.
7. H. Chen et al., "TSS: Efficient Term Set Search in Large Peer-to-Peer Textual Collections," IEEE Trans. Computers, vol. 59, no. 7, 2010, pp. 969–980.
8. J. Li et al., "On the Feasibility of Peer-to-Peer Web Indexing and Search," Proc. Int'l Workshop Peer-To-Peer Systems (IPTPS 03), LNCS 2735, Springer, 2003, pp. 207–215.
9. P. Reynolds and A. Vahdat, "Efficient Peer-to-Peer Keyword Searching," Proc. Middleware, Springer, 2003, pp. 21–40.
10. G. Pass, A. Chowdhury, and C. Torgeson, "A Picture of Search," Proc. Int'l Conf. Scalable Information Systems (InfoScale), ACM Press, 2006, pp. 1–7.
12 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool