Efficient Pattern Matching over Uncertain Data Streams

References

• Agrawal, R., Faloutsos C., Swami, A.N., Efficient similarity search in sequence databases. FODO. (1993).
   Google Scholar
• Aref, W.G., Samet, H., Optimisation for spatial query processing. VLDB. (1991).
   Google Scholar
• Bayer, R., McCreight, E.M., Organisation and maintenance of large ordered indices. Acta Inf. (1972).
   Google Scholar
• Beskales, G., Soliman, M., Ilyas, I.F., Efficient search for the top-k probable nearest neighbours inuncertain databases. VLDB. (2008).
   Google Scholar
• Böhm, C., Pryakhin, A., Schubert, M., The Gauss-tree: efficient object identification in databases of probabilistic feature vectors. ICDE. (2006).
   Google Scholar
• Cai, Y. Ng, R., Indexing spatio-temporal trajectoires with Chebyshev polynomials. SIGMOD. (2004).
   Google Scholar
• Chen, L., Özsu, M.T., Oria, V., Robust and fast similarity search for moving object trajectories. SIGMOD. (2005).
   Google Scholar
• Chen, Q., Chen, L., Lian, X., Liu, Y., Yu, J.X., Indexable PLA for efficient similarity search. VLDB. (2007).
   Google Scholar
• Cheng, R., Kalashnikov, D., Prabhakar, S., Querying imprecise data in moving object environments. TKDE. Volume 16. (2004).
   Google Scholar
• Cheng, R., Kalashnikov, D.V., Prabhakar, S., Evaluating probabilistic queries over imprecise data. SIGMOD. (2003).
   Google Scholar
• Cheng, R., Singh, S., Prabhakar, S., Shah, R., Vitter, J.S., Xia, Y., Efficient join processing over uncertain data. CIKM. (2006).
   Google Scholar
• Cheng, R., Xia, Y., Prabhakar, S., Shah, R., Vitter, J., Efficient indexing methods for probabilistic threshold queries over uncertain data. VLDB. (2004).
   Google Scholar
• Cheng, R., Zhang, Y., Bertino, E., Prabhakar, S., Preserving user location privacy in mobile data management infrastructures. Privacy Enhancing Technologies. (2006).
   Google Scholar
• Cormode, G., Garofalakis, M., Sketching probabilistic data streams. SIGMOD. (2007).
   Google Scholar
• Das, G., Gunopulos, D., Koudas, N., Sarkas, N., Ad-hoc top-k query answering for data streams. VLDB. (2007).
   Google Scholar
• Diao, Y., Li, B., Liu, A., Peng, L., Sutton, C., Tran, T., Zink, M., Capturing data uncertainty in high-volume stream processing. CIDR. (2009).
   Google Scholar
• Faloutsos, C., Ranganathan, M., Manolopoulos, Y., Fast subsequence matching in time-series databases. SIGMOD. (1994).
   Google Scholar
• Faradjian, A., Gehrke, J., Bonnet, P., Gadt: A probability space ADT for representing and querying the physical world. ICDE. (2002).
   Google Scholar
• Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.J., Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. VLDB. (2001).
   Google Scholar
• Guttman, A. R-trees: a dynamic index structure for spatial searching. SIGMOD. (1984).
   Google Scholar
• Hua, M., Pei, J., Zhang, W., Lin, X., Ranking queries on uncertain data: a probabilistic threshold approach. SIGMOD. (2008).
   Google Scholar
• Ishikawa, Y., Iijima, Y., Yu, J.X., Processing spatial range queries for objects with imprecise gaussian-based location information. ICDE. (2009).
   Google Scholar
• Jayram, T.S., McGregor, A., Muthukrishnan, S., Vee, E. Estimating statistical aggregates on probabilistic data streams. TODS. Volume 33, No 4. (2008).
   Google Scholar
• Jeffery, S.R., Franklin, M.J., Garofalakis, M., An adaptive rfid middleware for supporting metaphysical data independence. VLDBJ. Volume 17, No 2. (2008).
   Google Scholar
• Jin, C., Yi, K., Chen, L., Yu, J.X., Lin, X., Space-efficient synopses for slidingwindow top-k queries on uncertain streams. VLDB. (2008).
   Google Scholar
• Kang, J., Naughton, J.F., Viglasg, S.D., Evaluating window joins over unbounded streams. ICDE. (2003).
   Google Scholar
• Ke, Y., Sukthankar, R., Huston, L., An efficient parts-based near-duplicate and sub-image retrieval system. ACMMM. (2004).
   Google Scholar
• Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S. Locally adaptive dimensionality reduction for indexing large time series databases. SIGMOD. (2001).
   Google Scholar
• Kriegel, H.-P., Kunath, P., Pfeifle, M., Renz, M., Probabilistic similarity join on uncertain data. DASFAA. (2006).
   Google Scholar
• Kriegel, H.-P., Kunath, P., Renz, M., Probabilistic nearest-neighbour query on uncertain objects. DASFAA. (2007).
   Google Scholar
• Lian X., Chen, L., Monochromatic and bichromatic reverse skyline search over uncertain databases. SIGMOD. (2008).
   Google Scholar
• Lian X., Chen, L., Probabilistic group nearest neighbour queries in uncertain databases. TKDE. (2008).
   Google Scholar
• Lian, X. Chen, L., Probabilistic ranked queries in uncertain databases. EDBT. (2008).
   Google Scholar
• Lian, X. Chen, L., Efficient processing of probabilistic reverse nearest neighbour queries over uncertain data. VLDBJ. (2009).
   Google Scholar
• Lian, X., Chen, L., Yu, J.X., Pattern matching over cloaked time series. ICDE. (2008).
   Google Scholar
• Ljosa, V., Singh, A.K., APLA: indexing arbitrary probability distributions. ICDE. (2007).
   Google Scholar
• Ljosa, V., Singh, A.K., Top-k spatial joins of probabilistic objects. ICDE. (2008).
   Google Scholar
• Mokbel, M.F., Chow, C.-Y., Aref, W.G., The new casper: query processing for location services without compromising privacy. VLDB. (2006).
   Google Scholar
• Mokbel, M.F., Lu, M., Aref, W.G., Hash-merge join: A non-blocking join algorithm for producing fast and early join results. ICDE. (2004).
   Google Scholar
• Mokbel, M.F., Xiong, X., Aref, W.G., SINA: Scalable incremental processing of continuous queries in spatio-temporal databases. SIGMOD. (2004).
   Google Scholar
• Papadimitriou, S., Li, F., Kollios, G., Yu, P.S., Time series compressibility and privacy. VLDB. (2007).
   Google Scholar
• Pei, J., Jiang, B., Lin, X., Yuan, Y., Probabilistic skylines on uncertain data. VLDB. (2007).
   Google Scholar
• Qiao, L., Agrawal, D., Abbadi, A.E., Supporting sliding window queries for continuous data streams. SSDBM. (2003).
   Google Scholar
• Tao, Y., Cheng, R., Xiao, X., Ngai, W.K., Kao, B., Prabhakar, S., Indexing multidimensional uncertain data with arbitrary probability density functions. VLDB. (2005).
   Google Scholar
• Tao, Y., Papadias, D., Maintaining sliding window skylines on data streams. TKDE. Volume 18, No 3. (2006).
   Google Scholar
• Tao, Y., Yiu, M.L., Papadias, D., Hadjieleftheriou, M., Mamoulis, N., RPJ: Producing fast join results on streams through rate-based optimisation. SIGMOD. (2005).
   Google Scholar
• Urhan, T., Franklin, M.J., Xjoin: A reactively-scheduled pipelined join operator. IEEE Data Eng Bull. Volume 23, No 2. (2000).
   Google Scholar
• Weber, R., Schek, H.-J., Blott, S., A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. VLDB. (1998).
   Google Scholar
• Wu, K.-L., Chen, S.-K., Yu, P.S., On range query indexing for efficient stream processing. SUTC. (2006).
   Google Scholar
• Xue, W., Luo, Q., Chen, L., Liu, Y., Contour map matching for event detection in sensor networks. SIGMOD. (2006).
   Google Scholar
• Yi, B.-K., Faloutsos, C., Fast time sequence indexing for arbitrary Lp norms. VLDB. (2000).
   Google Scholar
• Zhang, Q., Li, F., Yi, K., Finding frequent items in probabilistic data. SIGMOD. (2008).
   Google Scholar
• Zhang, W., Lin, X., Zhang, Y., Wang, W., Yu, J.X., Probabilistic skyline operator over sliding windows. ICDE. (2009).
   Google Scholar