ASTERIX: Scalable warehouse-style web data integration

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages

  Alsubaiee, Sattam ^a   Behm, Alexander ^a   Grover, Raman ^a   Vernica, Rares ^a   Borkar, Vinayak ^a   Carey, Michael J ^a   Li, Chen ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

ASTERIX; cloud computing; data intensive computing; hyracks; semistructured data

Indexed keywords

ANALYSIS CAPABILITIES; ASTERIX; BIG DATUM; DATA-INTENSIVE COMPUTING; DIGITAL INFORMATION; FUZZY MATCHING; HYRACKS; MANAGEMENT PLATFORMS; ONLINE COMMUNITIES; REAL EXAMPLE; SEMI STRUCTURED DATA; SOCIAL NETWORKS; SPATIAL AGGREGATION; SPATIAL DATA; WEB DATA INTEGRATION;

CLOUD COMPUTING; DATABASE SYSTEMS; INFORMATION MANAGEMENT; INFORMATION RETRIEVAL;

WAREHOUSES;

EID: 84865016315     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2331801.2331803     Document Type: Conference Paper

References (25)

1. ASTERIX Website. http://asterix.ics.uci.edu/.
2. D. J. Abadi et al. The design of the Borealis stream processing engine. In In CIDR, 2005.
3. Apache Hive, http://hadoop.apache.org/hive.
4. A. Arasu et al. Stream: The stanford stream data manager. IEEE Data Eng. Bull., 26(1):19-26, 2003.
5. A. Behm, V. R. Borkar, M. J. Carey, R. Grover, C. Li, N. Onose, R. Vernica, A. Deutsch, Y. Papakonstantinou, and V. J. Tsotras. ASTERIX: towards a scalable, semistructured data platform for evolving-world models. Distributed and Parallel Databases, 2011.
6. A. Behm, C. Li, and M. J. Carey. Answering approximate string queries on large data sets using external memory. In ICDE, 2011.
7. P. A. Bernstein and L. M. Haas. Information integration in the enterprise. Commun. ACM, 51(9):72-79, Sept. 2008.
8. V. R. Borkar et al. Hyracks: A flexible and extensible foundation for data-intensive computing. In ICDE, 2011.
9. L. Gravano et al. Approximate string joins in a database (almost) for free. In VLDB, pages 491-500, 2001.
10. M. Hadjieleftheriou, A. Chandel, N. Koudas, and D. Srivastava. Fast indexes and algorithms for set similarity selection queries. In ICDE, 2008.
11. Jaql, http://www.jaql.org.
12. I. Lazaridis and S. Mehrotra. Progressive approximate aggregate queries with a multi-resolution tree structure. In SIGMOD, 2001.
13. M. Li, M. Mani, E. A. Rundensteiner, and T. Lin. Complex event pattern detection over streams with interval-based temporal semantics. In Proc. of the 5th ACM Int. Conf. on Distrib. Event-Based Systems, pages 291-302, 2011.
14. M. Mathioudakis, N. Bansal, and N. Koudas. Identifying, attributing and describing spatial bursts. PVLDB, 3(1), 2010.
15. G. Navarro. A guided tour to approximate string matching. ACM Comput. Surv., 33(1):31-88, 2001.
16. Object database management systems. http://www.odbms.org/odmg/.
17. C. Olston et al. Pig Latin: a not-so-foreign language for data processing. In SIGMOD, 2008.
18. D. Papadias, P. Kalnis, J. Zhang, and Y. Tao. Efficient olap operations in spatial data warehouses. In SSTD, 2001.
19. D. Papadias, Y. Tao, P. Kalnis, and J. Zhang. Indexing spatio-temporal data warehouses. In ICDE, 2002.
20. S. Sarawagi and A. Kirpal. Efficient set joins on similarity predicates. In SIGMOD Conference, 2004.
21. V. Shkapenyuk, T. Johnson, and D. Srivastava. Bistro data feed management system. SIGMOD, 2011.
22. R. Vernica. Efficient Processing of Set-Similarity Joins on Large Clusters. Ph.D. thesis, UC Irvine, 2011.
23. R. Vernica, M. J. Carey, and C. Li. Efficient parallel set-similarity joins using MapReduce. In SIGMOD, 2010.
24. D. Wang, E. A. Rundensteiner, R. T. Ellison, and H. Wang. Active complex event processing infrastructure: Monitoring and reacting to event streams. In ICDE Workshops, 2011.
25. C. Xiao, W. Wang, and X. Lin. Ed-join: An efficient algorithm for similarity joins with edit distance constraints. In VLDB, 2008.