On generating all maximal independent sets
Information Processing Letters
Assumptions and issues in text-based retrieval
Text-based intelligent systems
Text representation for intelligent text retrieval: a classification-oriented view
Text-based intelligent systems
Direction-based text interpretation as an information access refinement
Text-based intelligent systems
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
ACM SIGIR Forum
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Finding and approximating top-k answers in keyword proximity search
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Avatar semantic search: a database approach to information retrieval
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Getting work done on the web: supporting transactional queries
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
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
BANKS: browsing and keyword searching in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficiently enumerating results of keyword search over data graphs
Information Systems
Keyword proximity search in complex data graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
SystemT: a system for declarative information extraction
ACM SIGMOD Record
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
Keyword search in databases: the power of RDBMS
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
Learning context-free grammars to extract relations from text
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Rewrite rules for search database systems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Facet discovery for structured web search: a query-log mining approach
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A graph approach to spelling correction in domain-centric search
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Serving information needs in business process consulting
BPM'11 Proceedings of the 9th international conference on Business process management
Automatic suggestion of query-rewrite rules for enterprise search
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Interpreting keyword queries over web knowledge bases
Proceedings of the 21st ACM international conference on Information and knowledge management
Predicting the effectiveness of keyword queries on databases
Proceedings of the 21st ACM international conference on Information and knowledge management
Learning joint query interpretation and response ranking
Proceedings of the 22nd international conference on World Wide Web
Efficient parsing-based search over structured data
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concepts and their interrelationship. The difficulty is to translate abstract notions like concept and interpretation into a concrete search algorithm that operates over the auxiliary database. To surpass existing heuristics, there is a need for a formal basis, which is realized in this paper through the framework of a search database system, where an interpretation is identified as a parse. It is shown that the parses of a query can be generated in polynomial time in the combined size of the input and the output, even if parses are restricted to those having a nonempty evaluation. Identifying that one parse is more specific than another is important for ranking answers, and this framework captures the precise semantics of being more specific; moreover, performing this comparison between parses is tractable. Lastly, the paper studies the problem of finding the most specific parses. Unfortunately, this problem turns out to be intractable in the general case. However, under reasonable assumptions, the parses can be enumerated in an order of decreasing specificity, with polynomial delay and polynomial space.