The document summarizes a system called ConQueSt that allows for interactive and constraint-based mining of frequent patterns from relational databases. It uses a query language called SPQL to define the input data and mining parameters. The system's mining engine efficiently handles a variety of constraints and pushes them deep into the mining process for performance and scalability. The talk describes the language, architecture, demo of the system, and ideas for future work.