Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
RE-tree: an efficient index structure for regular expressions
The VLDB Journal — The International Journal on Very Large Data Bases
Processing XML streams with deterministic automata and stream indexes
ACM Transactions on Database Systems (TODS)
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Generating query substitutions
Proceedings of the 15th international conference on World Wide Web
Effective keyword search in relational databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Avatar semantic search: a database approach to information retrieval
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Duplicate Record Detection: A Survey
IEEE Transactions on Knowledge and Data Engineering
Navigating the intranet with high precision
Proceedings of the 16th international conference on World Wide Web
Discover: keyword search in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient IR-style keyword search over relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
An efficient filter for approximate membership checking
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
SQAK: doing more with keywords
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the VLDB Endowment
Foundations and Trends in Databases
Understanding user's query intent with wikipedia
Proceedings of the 18th international conference on World wide web
Classifying and Characterizing Query Intent
ECIR '09 Proceedings of the 31th European Conference on IR Research on Advances in Information Retrieval
An Algebraic Approach to Rule-Based Information Extraction
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
SPARK: A Keyword Search Engine on Relational Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Query segmentation using conditional random fields
Proceedings of the First International Workshop on Keyword Search on Structured Data
Efficient approximate entity extraction with edit distance constraints
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Keyword search on structured and semi-structured data
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Good abandonment in mobile and PC internet search
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Towards rich query interpretation: walking back and forth for mining query templates
Proceedings of the 19th international conference on World wide web
Learning with click graph for query intent classification
ACM Transactions on Information Systems (TOIS)
Understanding queries in a search database system
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Structured annotations of web queries
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
On indexing error-tolerant set containment
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Unsupervised query segmentation using only query logs
Proceedings of the 20th international conference companion on World wide web
Addressing people's information needs directly in a web search result page
Proceedings of the 20th international conference on World wide web
Proceedings of the 20th international conference on World wide web
Foundations and Trends in Databases
Rewrite rules for search database systems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Faerie: efficient filtering algorithms for approximate dictionary-based entity extraction
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient query rewrite for structured web queries
Proceedings of the 20th ACM international conference on Information and knowledge management
Hi-index | 0.00 |
Parsing-based search, i.e., parsing keyword search queries using grammars, is often used to override the traditional "bag-of-words'" semantics in web search and enterprise search scenarios. Compared to the "bag-of-words" semantics, the parsing-based semantics is richer and more customizable. While a formalism for parsing-based semantics for keyword search has been proposed in prior work and ad-hoc implementations exist, the problem of designing efficient algorithms to support the semantics is largely unstudied. In this paper, we present a suite of efficient algorithms and auxiliary indexes for this problem. Our algorithms work for a broad classes of grammars used in practice, and cover a variety of database matching functions (set- and substring-containment, approximate and exact equality) and scoring functions (to filter and rank different parses). We formally analyze the time complexity of our algorithms and provide an empirical evaluation over real-world data to show that our algorithms scale well with the size of the database and grammar.