
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Shaoxu Song, Lei Chen, Mingxuan Yuan, "Materialization and Decomposition of Dataspaces for Efficient Search," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 12, pp. 18721887, December, 2011.  
BibTex  x  
@article{ 10.1109/TKDE.2010.213, author = {Shaoxu Song and Lei Chen and Mingxuan Yuan}, title = {Materialization and Decomposition of Dataspaces for Efficient Search}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {23}, number = {12}, issn = {10414347}, year = {2011}, pages = {18721887}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.213}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Materialization and Decomposition of Dataspaces for Efficient Search IS  12 SN  10414347 SP1872 EP1887 EPD  18721887 A1  Shaoxu Song, A1  Lei Chen, A1  Mingxuan Yuan, PY  2011 KW  Dataspaces KW  materialization KW  decomposition. VL  23 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] M.J. Franklin, A.Y. Halevy, and D. Maier, "From Databases to Dataspaces: A New Abstraction for Information Management," SIGMOD Record, vol. 34, no. 4, pp. 2733, 2005.
[2] A.Y. Halevy, M.J. Franklin, and D. Maier, "Principles of Dataspace Systems," Proc. 25th ACM SIGMODSIGACTSIGART Symp. Principles of Database Systems (PODS '06), pp. 19, 2006.
[3] M.J. Franklin, A.Y. Halevy, and D. Maier, "A First Tutorial on Dataspaces," Proc. VLDB Endowment, vol. 1, no. 2, pp. 15161517, 2008.
[4] J. Madhavan, S. Cohen, X.L. Dong, A.Y. Halevy, S.R. Jeffery, D. Ko, and C. Yu, "WebScale Data Integration: You can Afford to Pay as You Go," Proc. Conf. Innovative Data Systems Research (CIDR), pp. 342350, 2007.
[5] S.R. Jeffery, M.J. Franklin, and A.Y. Halevy, "PayAsYouGo User Feedback for Dataspace Systems," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '08), pp. 847860, 2008.
[6] A.D. Sarma, X. Dong, and A.Y. Halevy, "Bootstrapping PayAsYouGo Data Integration Systems," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '08), pp. 861874, 2008.
[7] M.A.V. Salles, J.P. Dittrich, S.K. Karakashian, O.R. Girard, and L. Blunschi, "Itrails: PayAsYouGo Information Integration in Dataspaces," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 663674, 2007.
[8] F.M. Suchanek, G. Kasneci, and G. Weikum, "Yago: A Core of Semantic Knowledge," Proc. 16th Int'l Conf. World Wide Web (WWW '07), pp. 697706, 2007.
[9] E. Rahm and P.A. Bernstein, "A Survey of Approaches to Automatic Schema Matching," Int'l J. Very Large Data Bases, vol. 10, no. 4, pp. 334350, 2001.
[10] X. Dong and A.Y. Halevy, "Indexing Dataspaces," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '07), pp. 4354, 2007.
[11] R. Fagin, "Combining Fuzzy Information: An Overview," SIGMOD Record, vol. 31, no. 2, pp. 109118, 2002.
[12] H. Bast, D. Majumdar, R. Schenkel, M. Theobald, and G. Weikum, "IoTopk: IndexAccess Optimized Topk Query Processing," Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB '06), pp. 475486, 2006.
[13] G. Salton, Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. AddisonWesley, 1989.
[14] F. Liu, C.T. Yu, W. Meng, and A. Chowdhury, "Effective Keyword Search in Relational Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '06), pp. 563574, 2006.
[15] H. Bast and I. Weber, "The Completesearch Engine: Interactive, Efficient, and Towards IR& DB Integration," Proc. Conf. Innovative Data Systems Research (CIDR), pp. 8895, 2007.
[16] R.A. BaezaYates and B.A. RibeiroNeto, Modern Information Retrieval. ACM Press / AddisonWesley, 1999.
[17] I.H. Witten, A. Moffat, and T.C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images, second ed. Morgan Kaufmann, 1999.
[18] J. Zobel and A. Moffat, "Inverted Files for Text Search Engines," ACM Computing Surveys, vol. 38, no. 2, pp. 155, 2006.
[19] R. Fagin, A. Lotem, and M. Naor, "Optimal Aggregation Algorithms for Middleware," Proc. 20th ACM SIGMODSIGACTSIGART Symp. Principles of Database Systems (PODS '01), 2001.
[20] D. Peleg, G. Schechtman, and A. Wool, "Approximating Bounded 01 Integer Linear Programs," Proc. Second Israel Symp. Theory and Computing Systems, pp. 6977, 1993.
[21] C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. PrenticeHall, Inc., 1982.
[22] V. Chvatal, "A Greedy Heuristic for the SetCovering Problem," Math. Operations Research, vol. 4, no. 3, pp. 233235, 1979.
[23] G. Dobson, "Worst Case Analysis of Greedy Heuristics for Integer Programming with NonNegative Data," Math. Operations Research, vol. 7, no. 4, pp. 515531, 1982.
[24] R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules in Large Databases," Proc. 20th Int'l Conf. Very Large Data Bases (VLDB '94), pp. 487499, 1994.
[25] J. Han, J. Pei, Y. Yin, and R. Mao, "Mining Frequent Patterns without Candidate Generation: A FrequentPattern Tree Approach," Data Mining and Knowledge Discovery, vol. 8, no. 1, pp. 5387, 2004.
[26] L. Lim, M. Wang, S. Padmanabhan, J.S. Vitter, and R.C. Agarwal, "Efficient Update of Indexes for Dynamically Changing Web Documents," J. World Wide Web, vol. 10, no. 1, pp. 3769, 2007.
[27] P. Grassberger and I. Procaccia, "Measuring the Strangeness of Strange Attractors," Physica D: Nonlinear Phenomena, vol. 9, nos. 1/2, pp. 189208, 1983.
[28] A. Belussi and C. Faloutsos, "Estimating the Selectivity of Spatial Queries Using the "Correlation" Fractal Dimension," Proc. 21th Int'l Conf. Very Large Data Bases (VLDB '95), pp. 299310, 1995.
[29] B.U. Pagel, F. Korn, and C. Faloutsos, "Deflating the Dimensionality Curse Using Multiple Fractal Dimensions," Proc. 16th Int'l Conf. Data Eng., pp. 589598, 2000.
[30] F. Korn, B.U. Pagel, and C. Faloutsos, "On the "Dimensionality Curse" and the "SelfSimilarity Blessing,"" IEEE Trans. Knowledge and Data Eng., vol. 13, no. 1, pp. 96111, Jan./Feb. 2001.
[31] J. Han and M. Kamber, Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000.
[32] B. Li, M. Hui, J. Li, and H. Gao, "IvaFile: Efficiently Indexing Sparse Wide Tables in Community Systems," Proc. IEEE Int'l Conf. Data Eng. (ICDE '09), pp. 210221, 2009.
[33] S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv, "Xsearch: A Semantic Search Engine for Xml," Proc. 29th Int'l Conf. Very Large Data Bases (VLDB '03), pp. 4556, 2003.
[34] S. Sarawagi and A. Kirpal, "Efficient Set Joins on Similarity Predicates," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '04), pp. 743754, 2004.
[35] E. Chu, J.L. Beckmann, and J.F. Naughton, "The Case for a WideTable Approach to Manage Sparse Relational Data Sets," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '07), pp. 821832, 2007.
[36] E. Chu, A. Baid, T. Chen, A. Doan, and J.F. Naughton, "A Relational Approach to Incrementally Extracting and Querying Structure in Unstructured Data," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 10451056, 2007.
[37] R. Agrawal, A. Somani, and Y. Xu, "Storage and Querying of eCommerce Data," Proc. 27th Int'l Conf. Very Large Data Bases (VLDB '01), pp. 149158, 2001.
[38] J.L. Beckmann, A. Halverson, R. Krishnamurthy, and J.F. Naughton, "Extending RDBMSs to Support Sparse Datasets Using an Interpreted Attribute Storage Format," Proc. 22nd Int'l Conf. Data Eng. (ICDE '06), p. 58, 2006.
[39] D.J. Abadi, A. Marcus, S. Madden, and K.J. Hollenbach, "Scalable Semantic Web Data Management Using Vertical Partitioning," Proc. 33rd Int'l Conf. Very Large Data Bases (VLDB '07), pp. 411422, 2007.
[40] D. Abadi, S. Madden, and N. Hachem, "ColumnStores Vs. RowStores: How Different are They Really?" Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '08), 2008.
[41] S. Chaudhuri, V. Ganti, and R. Kaushik, "A Primitive Operator for Similarity Joins in Data Cleaning," Proc. 22nd Int'l Conf. Data Eng. (ICDE '06), p. 5, 2006.
[42] A. Arasu, V. Ganti, and R. Kaushik, "Efficient Exact SetSimilarity Joins," Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB '06), pp. 918929, 2006.
[43] E. Ukkonen, "Approximate String Matching with qGrams and Maximal Matches," Theoretical Computer Science—Selected Papers of the Combinatorial Pattern Matching School, vol. 92, no. 1, pp. 191211, 1992.
[44] A.P. de Vries, N. Mamoulis, N. Nes, and M.L. Kersten, "Efficient kNN Search on Vertically Decomposed Data," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '02), pp. 322333, 2002.
[45] G. Gou, M. Kormilitsin, and R. Chirkova, "Query Evaluation Using Overlapping Views: Completeness and Efficiency," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD), pp. 3748, 2006.
[46] S. Chaudhuri, M. Datar, and V.R. Narasayya, "Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution," IEEE Trans. Knowledge and Data Eng., vol. 16, no. 11, pp. 13131323, Nov. 2004.
[47] S. Agrawal, S. Chaudhuri, and V.R. Narasayya, "Automated Selection of Materialized Views and Indexes in Sql Databases," Proc. 26th Int'l Conf. Very Large Data Bases (VLDB '00), pp. 496505, 2000.
[48] G. Valentin, M. Zuliani, D.C. Zilio, G.M. Lohman, and A. Skelley, "DB2 Advisor: An Optimizer Smart Enough to Recommend Its Own Indexes," Proc. 16th Int'l Conf. Data Eng., pp. 101110, 2000.
[49] R. Chirkova and C. Li, "Materializing Views with Minimal Size to Answer Queries," Proc. 22nd ACM SIGMODSIGACTSIGART Symp. Principles of Database Systems (PODS '03), pp. 3848, 2003.
[50] C. Heeren, H.V. Jagadish, and L. Pitt, "Optimal Indexing Using NearMinimal Space," Proc. 22nd ACM SIGMODSIGACTSIGART Symp. Principles of Database Systems (PODS '03), pp. 244251, 2003.
[51] K. Aouiche and J. Darmont, "Data MiningBased Materialized View and Index Selection in Data Warehouses," J. Intelligent Information Systems, vol. 33, no. 1, pp. 6593, 2009.
[52] N. Lester, A. Moffat, and J. Zobel, "Fast OnLine Index Construction by Geometric Partitioning," Proc. 14th ACM Int'l Conf. Information and Knowledge Management (CIKM '05), pp. 776783, 2005.
[53] N. Mamoulis, "Efficient Processing of Joins on SetValued Attributes," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '03), pp. 157168, 2003.
[54] S. Idreos, M.L. Kersten, and S. Manegold, "Database Cracking," Proc. Conf. Innovative Data Systems Research (CIDR), pp. 6878, 2007.
[55] S. Idreos, M.L. Kersten, and S. Manegold, "Updating a Cracked Database," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD '07), pp. 413424, 2007.