We studied the problem of constraint-based pattern mining for three different data formats, item-set, sequence and graph, and focused on mining patterns of large sizes. Colossal patterns in each data formats are studied to discover pruning properties that are useful for direct mining of these patterns. For item-set data, we observed robustness of colossal patterns. By defining the concept of core patterns, we developed a randomized mining framework to efficiently find the set of colossal patterns which gives a good approximation to the complete pattern set. The essential idea of pattern fusion and leaping toward large patterns is then extended to the cases of sequential and graph data. In sequential data, we developed a novel algorithm to accommodate approximate patterns. For graph data, we proposed the concept of spiders and used these pre-computed frequent structures of small sizes to quickly leap to reach those much larger ones. We also proposed a general graph mining framework, called gPrune, to take advantage of both pattern and data space pruning. Ideas and techniques developed in this work can be extended to handle other user-specified constraints for direct efficient mining in large-scale data. [The dissertation citations contained here are published with the permission of ProQuest LLC. Further reproduction is prohibited without permission. Copies of dissertations may be obtained by Telephone (800) 1-800-521-0600. Web page: http://www.proquest.com/en-US/products/dissertations/individuals.shtml.]