Results 181 to 190 of about 264,311 (215)
Some of the next articles are maybe not open access.
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, 2011
In scientific research, it is often difficult to express information needs as simple keyword queries. We present a more natural way of searching for relevant scientific literature. Rather than a string of keywords, we define a query as a small set of papers deemed relevant to the research task at hand.
Khalid El-Arini, Carlos Guestrin
openaire +1 more source
In scientific research, it is often difficult to express information needs as simple keyword queries. We present a more natural way of searching for relevant scientific literature. Rather than a string of keywords, we define a query as a small set of papers deemed relevant to the research task at hand.
Khalid El-Arini, Carlos Guestrin
openaire +1 more source
2020
This chapter introduces searchable encryption (SE), a cryptographic primitive supporting search over encrypted data using keywords. SE plays an important role in current cloud storage systems. It enables users to retrieve target data from their entire data set in an efficient way without leakage of the data contents.
Yuan Zhang +2 more
openaire +1 more source
This chapter introduces searchable encryption (SE), a cryptographic primitive supporting search over encrypted data using keywords. SE plays an important role in current cloud storage systems. It enables users to retrieve target data from their entire data set in an efficient way without leakage of the data contents.
Yuan Zhang +2 more
openaire +1 more source
Keyword search over RDF graphs
Proceedings of the 20th ACM international conference on Information and knowledge management, 2011Large knowledge bases consisting of entities and relationships between them have become vital sources of information for many applications. Most of these knowledge bases adopt the Semantic-Web data model RDF as a representation model. Querying these knowledge bases is typically done using structured queries utilizing graph-pattern languages such as ...
Elbassuoni, S., Blanco, R.
openaire +3 more sources
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