dc.relation.reference | [1] Sony Corporation. http://www.sony.co.jp/.
[2] The UCR Time Series Data Mining Archive. http://www.cs.ucr.edu/ eamonn/TSDMA/.
[3] S. Acharya, R. Alonso, M. J. Franklin, and S. B. Zdonik. Broadcast Disks: Data Management
for Asymmetric Communications Environments. In Proceedings of the 1995 ACM
International Conference on Management of Data, pages 199–210, May 1995.
[4] S. Acharya, M. J. Franklin, and S. B. Zdonik. Disseminating updates on broadcast disks.
In Proceedings of the 22th International Conference on Very LargeData Bases, pages 354–
365. Morgan Kaufmann, September 1996.
[5] S. Acharya and S. Muthukrishnan. Scheduling on-demand broadcasts: New metrics and
algorithms. In Proceedings of the 4th ACM/IEEE International Conference on Mobile Computing
and Networking, pages 43–54, 1998.
[6] C. C. Aggarwal, J. L. Wolf, and P. S. Yu. A Permutation-Based Pyramid Broadcasting
Scheme for Video-on-Demand Systems. In IEEE Proceedings of Multimedia, 1996.
[7] R. Agrawal,C. Faloutsos, andA. Swami. Efficient Similarity Search in Sequence Databases.
In Proceedings of the 4th Conference on Foundations of Data Organization and Algorithms,
1993.
[8] D. Aksoy and M. J. Franklin. Scheduling for Large-Scale On-Demand Data Broadcasting.
In Proceedings of IEEE INFOCOM, March 1998.
[9] D. Aksoy, M. J. Franklin, and S. Zdonik. Data staging for on-demand broadcast. In Proceedings
of the 27th International Conference on Very Large Data Bases, pages 571–580,
September 2001.
[10] D. Aksoy and M. S. Leung. Pull vs Push: a Quantitative Comparison for Data Broadcast.
In Proceedings of IEEE GLOBECOM, 2004.
[11] S. Arya, D.M.Mount, R. Silverman, and A. Y.Wu. An Optimal Algorithm for Approximate
Nearest Neighbor Searching in Fixed Dimensions. Journal of the ACM, 1998.
[12] B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and Issues in Data
Stream Systems. In Proc. of ACM PODS, 2002.
[13] B. Babcock and C. Olston. Distributed top-k monitoring. In Proceedings of ACM SIGMOD,
2003.
[14] W.-T. Balke,W. Nejdl,W. Siberski, and U. Thaden. Progressive Distributed Top-k Retrieval
in Peer-to-Peer Networks. In Proceedings of IEEE ICDE, 2005.
[15] D. Barbará. Mobile computing and database - a survey. IEEE Transactions on Knowledge
and Data Engineering, 11(1):108–117, 1999.
[16] M. Bawa, R. J. Bayardo, S. Rajagopalan, and E. J. Shekita. Make it Fresh, Make it Quick -
Searching a Network of Personal Webservers. In ACM WWW, 2003.
[17] P. Boncz, T. Grust, M. van Keulen, S. Manegold, J. Rittinger, and J. Teubner. MonetDB/
XQuery: a Fast XQuery Processor Powered by a Relational Engine. In Proceedings
of ACM SIGMOD, 2006.
[18] A. Bulut and A. Singh. SWAT: hierarchical stream summarization in large networks. In
Proc. of ICDE, 2003.
[19] A. Bulut and A. Singh. A Unified Framework for Monitoring Data Streams in Real Time.
In Proc. of ICDE, 2005.
[20] K. Chakrabarti, E. Keogh, S. Mehrotra, and M. Pazzani. Locally Adaptive Dimensionality
Reduction for Indexing Large Time Series Databases. ACM TODS, 27(2), 2002.
[21] F. K. P. Chan, A. W. C. Fu, and C. Yu. Haar Wavelets for Efficient Similarity Search of
Time-Series: With and Without Time Warping. IEEE TKDE, 15(3), 2003.
[22] K. P. Chan and A. W. C. Fu. Efficient Time Series Matching by Wavelets. In Proceedings
of IEEE ICDE, 1999.
[23] S. Chaudhuri and L. Gravano. Optimizing Queries over Multimedia Repositories. In Proceedings
of ACM SIGMOD, 1996.
[24] S. Chaudhuri, L. Gravano, and A. Marian. Optimizing Top-K Selection Queries over Multimedia
Repositories. IEEE TKDE, 16(8), 2004.
[25] Y. S. Chen, Y. P. Hung, and C. S. Fuh. Fast Block Matching Algorithm Based on the
Winner-Update Strategy. IEEE Transactions on Image Processing, 10(8), 2001.
[26] Y.-Y. Chen, T. Suel, and A. Markowetz. Efficient Query Processing in Geographic Web
Search Engines. In Proceedings of ACM SIGMOD, 2006.
[27] R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating Probabilistic Queries over Imprecise
Data. In Proceedings of ACM SIGMOD, 2003.
[28] R. Chengy, B. Kaox, S. Prabhakarz, A. Kwanx, and Y. Tuz. Adaptive Stream Filters for
Entity-based Queries with Non-Value Tolerance. In Proceedings of VLDB, 2005.
[29] Y. Chung and M. Kim. Efficient data placement for wireless broadcast. Distributed and
Parallel Database, 9(2), March 2001.
[30] Y. C. Chung, C. C. Chen, and C. Lee. Time Constrained Service on Air. In Proceedings of
IEEE ICDCS, 2005.
[31] Y. D. Chung and M. H. Kim. Qem: A scheduling method for wireless broadcast data. In
Proceedings of the International Conference on Database Systems for Avanced Applications
(DSFAA’99), pages 135–142, 1999.
[32] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms.
McGraw-Hill.
[33] G. Cormode, M. Garofalakis, and D. Sacharidis. Fast Approximate Wavelet Tracking on
Streams. In Proceedings of EDBT 2006, 2006.
[34] G. Cormode, S. Muthukrishnan, and I. Rozenbaum. Summarizing and Mining Inverse Distributions
on Data Streams via Dynamic Inverse Sampling. In Proceedings of VLDB, 2005.
[35] H. M. Dewan, S. J. Stolfo, M. Hernandez, and J.-J. Hwang. Predictive Dynamic Load
Balancing of Parallel and Distributed Rule and Query Processing. In Proceedings of ACM
SIGMOD, 1994.
[36] S. Even and Y. Shiloah. NP-Completeness of Several Arrangement Problems. Department
of Computer Science, Israel Institute of Technology, Haifa, Isreal, Tech. Rep., 1975.
[37] R. Fagin, A. Lotem, and M. Naor. Optimal Aggregation Algorithms for Middleware. In
Proc. of PODS, 2001.
[38] G. H. Forman and J. Zahorjan. The Challenges of Mobile Computing. IEEE Transactions
on Computers, 27(4), 1994.
[39] L. Gao, Z. Yao, and X. S. Wang. Evaluating Continuous Nearest Neighbor Queries for
Streaming Time Series via Pre-fetching. In Proceedings of ACM CIKM, 2002.
[40] M. Garey and D. Johnson. A Guide to the Theory of NP-Completeness. Freeman.
[41] M. Garofalakis, J. Gehrke, and R. Rastogi. Querying and Mining Data Streams: You Only
Get One Look. In Proceedings of ACM SIGMOD, 2002.
[42] M. Garofalakis and P. B. Gibbons. Probabilistic Wavelet Synopses. ACM TODS, 29(1),
2004.
[43] M. Garofalakis and A. Kumar. Deterministic Wavelet Thresholding for Maximum-Error
Metrics. In Proceedings of ACM PODS, 2004.
[44] A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. One-Pass Wavelet Decompositions
of Data Streams. IEEE TKDE, 15(3), 2003.
[45] L. Golab and M. T. ˝Ozsu. Issues in Data Stream Management. ACM SIGMOD Record,
32(2), 2003.
[46] D. E. Goldberg. Genetic Algorithm in Search, Optimization and Machine Learning.
Addison-Wesley Publishing, 1989.
[47] G. Graefe. Query Evaluation Techniques for Large Databases. ACM Computing Surveys,
25(2), 1993.
[48] S. Guha and B. Harb. Wavelet Synopsis for Data Streams: Minimizing Non-Euclidean
Error. In Proc. of KDD, 2005.
[49] S. Guha, C. Kim, and K. Shim. XWAVE: Approximate Extended Wavelets for Streaming
Data. In Proc. of VLDB, 2004.
[50] S. Guha, N. Koudas, and K. Shim. Approximation and Streaming Algorithms for Histogram
Construction Problems. ACM TODS, 31(1), 2006.
[51] S. Guha, K. Shim, and J.Woo. REHIST: Relative Error Histogram Construction Algorithms.
In Proceedings of VLDB, 2004.
[52] J. H. Holland. Adaption in Natural and Artificial Systems. University of Michigan Press,
Ann Arbor, 1975.
[53] M. J. Hsieh, M. S. Chen, and P. S. Yu. Integrating DCT and DWT for Approximating Cube
Streams. In Proc. of ACM CIKM, 2005.
[54] C.-H. Hsu, G. Lee, andA. L. P. Chen. ANear Optimal Algorithm for Generating Broadcast
Programs on Multiple Channels. In Proceedings of the 10th ACM International Conference
on Information and Knowledge Management, pages 303–309, November 2001.
[55] C. H. Hsu, G. Lee, and A. L. P. Chen. An Efficient Algorithm for Near Optimal Data
Allocation on Multiple Broadcast Channels. Distributed and Parallel Databases, 18(3),
2005.
[56] C. L. Hu andM. S. Chen. On-Line Scheduling Sequential Objects for Dynamic Information
Dissemination. In Proceedings of IEEE GLOBECOM, 2005.
[57] J.-L. Huang andM.-S. Chen. Broadcast program generation for unordered queries with data
replication. In Proceedings of ACM SAC, March 2003.
[58] J.-L. Huang and M.-S. Chen. Broadcasting dependent data for ordered queries without
replication in a multi-channel mobile environment. In Proceedings of the 19th IEEE International
Conference on Data Engineering, March 2003.
[59] J.-L. Huang, M.-S. Chen, and H.-P. Hung. A QoS-Aware Transcoding Proxy Using Ondemand
Data Broadcasting. In Proceedings of IEEE INFOCOM, March 2004.
[60] H. P.Hung, J. W. Huang, J. L. Huang, andM. S. Chen. Scheduling Dependent Items in Data
Broadcasting Environments. In Proceedings of ACM SAC, 2006.
[61] T. Imielinski and B. R. Badrinath. Wireless Mobile Computing: Challenges in Data Management.
Communications of ACM, 37(10), 1994.
[62] T. Imielinski, S. Viswanathan, and B. R. Badrinath. Data on air: Organization and access.
IEEE Transactions on Knowledge and Data Engineering, 9(3):353–372, May/June 1997.
[63] Y. E. Ioannidis. Query Optimization. ACM Computing Surveys, 28(1), 1996.
[64] J.-L. Huang andM.-S. Chen. Dependent data broadcasting for unordered queries in a multiple
channel mobile environment. IEEE Trans. on Knowledge and Data Engineering, 16(6),
Jun. 2004.
[65] H. V. Jagadish. Issues in Multimedia Databases. In Proceedings of ACM SIGMOD, 1993.
[66] H. V. Jagadish, H. Jin, B. C. Ooi, and K.-L. Tan. Global Optimization of Histograms. In
Proc. of SIGMOD, 2001.
[67] M. Jarke and J. Koch. Query Optimization in Database Systems. ACM Computing Surveys,
16(2), 1984.
[68] L.-S. Juhn and L.-M. Tseng. Fast Data Broadcasting and Receiving Scheme for Popular
Video Service. IEEE Tran. on Broadcasting, 44(1), March 1998.
[69] K. V. Kanth, D. Agrawal, and A. Singh. Dimensionality Reduction for Similarity Searching
in Dynamic Databases. In Proceedings of ACM SIGMOD, 1998.
[70] P. Karras and N. Mamoulis. One-Pass Wavelet Synopses for Maximum-Error Metrics. In
Proceedings of VLDB, 2005.
[71] F. Korn, H. Jagadish, and C. Faloutsos. Efficiently Supporting Ad Hoc Queries in Large
Datasets of Time Sequences. In Proceedings of ACM SIGMOD, 1997.
[72] F. Korn, S. Muthukrishnan, and D. Srivastava. Reverse Nearest Neighbor Aggregates Over
Data Streams. In VLDB, pages 814–825, 2002.
[73] N. Koudas, B. C. Ooi, K.-L. Tan, and R. Zhang. Approximate NN queries on Streams with
Guaranteed Error/performance Bounds. In Proc. of VLDB, 2004.
[74] C. C. Lee and Y. Leu. Efficient Data Broadcast Schemes for Mobile Computing Environments
with Data Missing. Information Sciences, 172(3-4), 2005.
[75] G. Lee, S. Lo, and A. Chen. Data Allocation on theWireless Broadcast Channel for Efficient
Query Processing. IEEE Tran. on Computers, 51(10), 2002.
[76] G. Lee and S. C. Lo. Broadcast Data Allocation for Efficient Access of Multiple Data Items
in Mobile Environments. Mobile Networks and Applications, 8(4), 2003.
[77] J. H. Lee, D. H. Kim, and C. W. Chung. Multi-Dimensional Selectivity Estimation Using
Compressed Histogram Information. In Proceedings of ACM SIGMOD, 1999.
[78] W.-C. Lee, Q. Hu, and D. L. Lee. A study on channel allocation for data dissemination in
mobile computing environments. ACM/Baltzer Mobile Networks and Applications, Special
Issue on Resource Management in Wireless Systems, 4(2):117–129, 1999.
[79] I. Liabotis, B. Theodoulidis, and M. Saraaee. Improving Similarity Search in Time Series
Using Wavelets. International Journal of Data Warehousing and Mining, 2(2), 2006.
[80] J. Lin, M. Vlachos, E. Keogh, and D. Gunopulos. Iterative Incremental Clustering of Time
Series. In Proceedings of EDBT, 2004.
[81] C.M. Liu and K. F. Lin. Efficient Scheduling Algorthms for Disseminating Dependent Data
in Wireless Mobile Environments. In Proceedings of IEEE International Conf. on Wireless
Networks, Communications and Mobile Computing, 2005.
[82] K. H. Liu, W. G. Teng, and M. S. Chen. Incremental Maintenance of Wavelet Synopses for
Data Streams. In Proceedings of Workshop on Temporal Data Mining: Algorithms, Theory
and Applications, 2005.
[83] W. Loh, S. Kim, and K.Whang. Index Interpolation: an Approach to SubsequenceMatching
Supporting Normalization Transform in Time-Series Databases. In Proceedings of ACM
CIKM, 2000.
[84] F. Martinez, J. Gonzalez, and I. Stojmenovic. A Parallel Hill Climbing Algorithm for Pushing
Dependent Data in Clients-Providers-Servers Systems. In Proceedings of Computer and
Communications, 2002.
[85] C. Mathis, T. Harder, and M. Haustein. Locking-Aware Structural Join Operators for XML
Query Processing. In Proceedings of ACM SIGMOD, 2006.
[86] Y.Matias, J. S. Vitter, and M. Wang. Wavelet-Based Histograms for Selectivity Estimation.
In Proceedings of ACM SIGMOD, 1998.
[87] Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programming. Springer
Verlag, New York, 2nd Edition, 1994.
[88] S. Michel, P. Triantafillou, and G. Weikum. KLEE: A Framework for Distributed Top-k
Query Algorithms. In Proceedings of VLDB, 2005.
[89] K. Mouratidis, M. Hadjieleftheriou, and D. Papadia. Conceptual Partitioning: An Efficient
Method for Continuous Nearest Neighbor Monitoring. In Proc. ACM SIGMOD, 2005.
[90] A. Nanopoulos, D. Katsaros, and Y. Manolopoulos. Effective Prediction of Web-User Accesses:
A Data Mining Approach. In Proc. of WEBKDD Workshop, 2001.
[91] V. Padmanabhan and L. Qiu. The Content and Access Dynamics of a Busy Web Site:
Findings and Implications. In Proceedings of ACM SIGCOMM, 2000.
[92] S. Papadimitriou, J. Sun, and C. Faloutsos. Streaming Pattern Discovery in Multiple Time-
Series. In Proc. of VLDB’05, 2005.
[93] W.-C. Peng and M.-S. Chen. Dynamic generation of data broadcasting programs for a
broadcast disk array in a mobile computing environment. In Proceedings of the 9th ACM
International Conference on Information and Knowledge Management, November 2000.
[94] W.-C. Peng and M.-S. Chen. Efficient Channel Allocation Tree Generation for Data Broadcasting
in a Mobile Computing Environment. Wireless Networks, 9(2):117–129, 2003.
[95] W.-C. Peng, J.-L. Huang, andM. S. Chen. Dynamic leveling: Adaptive data broadcasting in
a mobile computing environment. Mobile Networks and Applications, 8(4):355–364, 2003.
[96] C. S. Perng, H. Wang, S. R. Zhang, and D. S. Parker. Landmarks: A New Model for
Similarity-Based Pattern Querying in Time Series Databases. In Proceedings of IEEE ICDE,
2000.
[97] M. Petropoulos, A. Deutsch, and Y. Papakonstantinou. Interactive Query Formulation over
Web Service-Accessed Sources. In Proceedings of ACM SIGMOD, 2006.
[98] I. Popivanov and R. J. Miller. Similarity Search Over Time-Series Data Using Wavelets. In
Proceedings of IEEE ICDE, 2002.
[99] N. Prabhu and V. Kumar. Data Scheduling for Multi-item and Transactional Requests in
On-demand Broadcast. In Proceedings of Mobile Data Management, 2005.
[100] N. Roussopoulos and S. K. F. Vincent. Nearest Neighbor Queries. In Proceedings of ACM
SIGMOD, 1995.
[101] F. Sadri. Reliability of Answers to Queries in Relational Databases. IEEE TKDE, 3(2),
1991.
[102] A. Si and H. V. Leong. Query Optimization for Broadcast Database. Data and Knowledge
Engineering, 23(9), 1999.
[103] E. J. Stollnitz, T. D. Derose, and D. H. Salesin. Wavelets for Computer Graphics: Theory
and Application. Morgan Kaufmann, 1996.
[104] C.-J. Su and L. Tassiulas. Broadcast scheduling for information distribution. In Proceedings
of the 16th IEEE Annual Joint Conference of the IEEE Computer and Communications
Societies. Driving the Information Revolution. (INFOCOM’97), pages 109–117, 1997.
[105] G. Syswerda. Uniform Crossover in Genetic Algorithms. In Proc. 3rd Int. Conf. on Genetic
Algorithms, 1989.
[106] S. Viswanathan and T. Imielinski. Pyramid Broadcasting for Video-on-Demand Service. In
SPIE Multimedia Computing and Networking Conference, 1995.
[107] J. S. Vitter and M. Wang. Approximate Computation of Multidimensional Aggregates of
Sparse Data Using Wavelets. In Proceedings of ACM SIGMOD, 1999.
[108] C. Wang and X. S. Wang. Supporting Subseries Nearest Neighbor Search via Approximation.
In Proceedings of ACM CIKM, 2000.
[109] J. W. Wong. Broadcast delivery. Proceedings of The IEEE, 76(12):1566–1577, December
1988.
[110] Y. Wu and G. Cao. Stretch-Optimal Scheduling for On-Demand Data Broadcasts. In Proc.
of Tenth Int. Conf. on Computer Communications and Networks, 2001.
[111] W.-G. Yee, S. B. Navathe, E. Omiecinski, and C. Jermaine. Efficient Data Allocation over
Multiple Channels at Broadcast Servers. IEEE Transactions on Computers, 51(10):1231–
1236, October 2002.
[112] C. T. Yu and C. C. Chang. On the Design of a Query Processing Strategy in a Distributed
Database Environment. In Proceedings of ACM SIGMOD, 1983.
[113] L. Y. Yuan and D.-A. Chiang. A Sound and Complete Query Evaluation Algorithm for
Relational Databases with Null Values. In Proceedings of ACM SIGMOD, 1988.
[114] Y. Zhao and S. Zhang. Generalized Dimension-Reduction Framework for Recent-Biased
Time Series Analysis. IEEE TKDE, 18(2), 2006.
[115] B. Zheng, X. Wu, X. Jin, and D. L. Lee. TOSA: a Near-Optimal Scheduling Algorithm for
Multi-Channel Data Broadcast. In Proceedings of Mobile Data Management (MDM-05),
2005.
[116] G. K. Zipf. Human Behaviour and the Principle of Least Effort. Addison-Wesley, Reading,
MA, 1949. | en |