Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A partition-based candidate network generation algorithm for keyword search on relational databases

From MaRDI portal
Publication:4926656
Jump to:navigation, search

DOI10.3969/J.ISSN.1001-0505.2012.04.006zbMATH Open1274.68108MaRDI QIDQ4926656FDOQ4926656


Authors:


Publication date: 20 June 2013





Recommendations

  • Dynamic result optimization for keyword search over relational databases
  • Keyword Search in Databases
  • A Top-\(K\) keyword search for supporting semantics in relational databases
  • Keyword search in relational database using data mining
  • CI-Rank: collective importance ranking for keyword search in databases


zbMATH Keywords

relational databasekeyword searchpartition strategycandidate network


Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Database theory (68P15)



Cited In (1)

  • A practically efficient algorithm for generating answers to keyword search over data graphs





This page was built for publication: A partition-based candidate network generation algorithm for keyword search on relational databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4926656)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4926656&oldid=19326968"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 06:58. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki