Results 241 to 250 of about 263,204 (290)
Some of the next articles are maybe not open access.
Searching Databases with Keywords
Journal of Computer Science and Technology, 2005Traditionally, SQL query language is used to search the data in databases. However, it is inappropriate for end-users, since it is complex and hard to learn. It is the need of end-user, searching in databases with keywords, like in web search engines. This paper presents a survey of work on keyword search in databases.
Shan Wang, Kun-Long Zhang
openaire +1 more source
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data, 2009
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the interconnected tuple structures in an RDB that cannot be easily identified using SQL on RDBMS.
Lu Qin, Jeffrey Xu Yu, Lijun Chang
openaire +1 more source
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the interconnected tuple structures in an RDB that cannot be easily identified using SQL on RDBMS.
Lu Qin, Jeffrey Xu Yu, Lijun Chang
openaire +1 more source
2021
Our third feature will allow a user to search for a book by its name. This is useful when the book list becomes very long – it can be hard for a user to find what they are looking for when content is more than one screen or page.
openaire +1 more source
Our third feature will allow a user to search for a book by its name. This is useful when the book list becomes very long – it can be hard for a user to find what they are looking for when content is more than one screen or page.
openaire +1 more source
Keyword-Centric Community Search
2019 IEEE 35th International Conference on Data Engineering (ICDE), 2019Community search that finds only the communities pertaining to the query input has been widely studied from simple graphs to attributed graphs. However, a significant limitation of previous studies is that they all require the input of query nodes, which makes it difficult for users to specify exact queries if they are unfamiliar with the queried graph.
Zhiwei Zhang +4 more
openaire +1 more source
Proceedings of the VLDB Endowment, 2011
Keyword search over a graph finds a substructure of the graph containing all or some of the input keywords. Most of previous methods in this area find connected minimal trees that cover all the query keywords. Recently, it has been shown that finding subgraphs rather than trees can be more useful and informative for the users. However, the
Mehdi Kargar, Aijun An
openaire +1 more source
Keyword search over a graph finds a substructure of the graph containing all or some of the input keywords. Most of previous methods in this area find connected minimal trees that cover all the query keywords. Recently, it has been shown that finding subgraphs rather than trees can be more useful and informative for the users. However, the
Mehdi Kargar, Aijun An
openaire +1 more source
2005
Abstract Many of the Eureka, First Search, Wilson Web, EBSCO Host, and other commercially available databases discussed in the previous chapter, like the library’s book catalog, are of the subject-heading or controlled vocabulary type.
openaire +1 more source
Abstract Many of the Eureka, First Search, Wilson Web, EBSCO Host, and other commercially available databases discussed in the previous chapter, like the library’s book catalog, are of the subject-heading or controlled vocabulary type.
openaire +1 more source
Towards heterogeneous keyword search
Proceedings of the ACM Turing 50th Celebration Conference - China, 2017Keyword search is a widely popular mechanism for query processing that alleviates users from understanding complex data structures and learning query languages. Existing keyword search systems are designed and tuned for one specific data model. In big data era, data is usually resident in heterogeneous data sources including unstructured data, semi ...
Chunbin Lin, Jianguo Wang, Chuitian Rong
openaire +1 more source
IEEE Transactions on Knowledge and Data Engineering, 2015
It is common that the objects in a spatial database (e.g., restaurants/hotels) are associated with keyword(s) to indicate their businesses/services/features. An interesting problem known as Closest Keywords search is to query objects, called keyword cover, which together cover a set of query keywords and have the minimum inter-objects distance.
Deng, Ke +3 more
openaire +2 more sources
It is common that the objects in a spatial database (e.g., restaurants/hotels) are associated with keyword(s) to indicate their businesses/services/features. An interesting problem known as Closest Keywords search is to query objects, called keyword cover, which together cover a set of query keywords and have the minimum inter-objects distance.
Deng, Ke +3 more
openaire +2 more sources
Fast multiple keyword searching
1992A new multiple keyword searching algorithm is presented as a generalization of a fast substring matching algorithm based on an n-gram technique. The expected searching time complexity is shown to be O((N/m+ml) log lm) under reasonable assumptions about the keywords together with the assumption that the text is drawn from a stationary ergodic source ...
Jong Yong Kim, John Shawe-Taylor
openaire +1 more source
Web Search Using Dynamic Keyword Suggestion
International Journal of Computers and Applications, 2007Web search has become an essential task for most people. As the Web grows rapidly, effective searches have grown increasingly important. Most of us, however, have experienced frustration in trying to search for something on the Web. In existing keyword-based Web search, the user has to come up with keywords for a query, and a search engine passively ...
Y. Park, B.S. Kim
openaire +1 more source