2008 IEEE 24th International Conference on Data Engineering 2008
DOI: 10.1109/icde.2008.4497504
|View full text |Cite
|
Sign up to set email alerts
|

NAGA: Searching and Ranking Knowledge

Abstract: The Web has the potential to become the world’s largest knowledge base. In order to unleash this potential, the wealth of information available on the Web needs to be extracted and organized. There is a need for new querying techniques that are simple and yet more expressive than those provided by standard keyword-based search engines. Searching for knowledge rather than Web pages needs to consider inherent semantic structures like entities (person, organization, etc.) and relationships (isA, locatedIn, etc.).… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
171
0

Year Published

2010
2010
2019
2019

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 185 publications
(172 citation statements)
references
References 6 publications
1
171
0
Order By: Relevance
“…Other works [45,46,37,25,47] have extended simple keyword-based search with structured queries capabilities. In [25,47], they propose a partial solution to the lack of expressiveness of the keyword-based approach by allowing search using conditions on attributes and values.…”
Section: Search Models For Semi-structured Datamentioning
confidence: 99%
See 1 more Smart Citation
“…Other works [45,46,37,25,47] have extended simple keyword-based search with structured queries capabilities. In [25,47], they propose a partial solution to the lack of expressiveness of the keyword-based approach by allowing search using conditions on attributes and values.…”
Section: Search Models For Semi-structured Datamentioning
confidence: 99%
“…In [25,47], they propose a partial solution to the lack of expressiveness of the keyword-based approach by allowing search using conditions on attributes and values. In [45,46,37], they present more powerful query language by adopting a graph-based model. However, the increase of query expressiveness is tied with the processing complexity, and the graph-based models [45,46,37] are not applicable on a very large scale.…”
Section: Search Models For Semi-structured Datamentioning
confidence: 99%
“…We now discuss related work on Semantic Web search (see especially [28] for a recent survey), which can roughly be divided into (1) approaches that are based on structured query languages, such as [17,30,35,38,45,46,50], and (2) approaches for naive users, requiring no familiarity with structured query languages. In this category, we distinguish keyword-based approaches, such as [13,33,34,40,51,52,55], where queries consist of lists of keywords, and natural-language-based approaches, such as [16,23,29,32,42,43], where users can express queries in natural language.…”
Section: Related Workmentioning
confidence: 99%
“…We first focus on some more general approaches [17,35,38] closest in spirit to ours in that they aim at providing general semantic search facilities. We then discuss some proposals [30,50,45,46] that address some specific aspects of semantic search or that are targeted at specific domains, so that they cannot be strictly viewed as semantic search engines.…”
Section: Related Workmentioning
confidence: 99%
“…Lehmann et al [14] then developed a tool for exploring relationships extracted by DBpedia. NAGA [15] is also a semantic search engine which searches semantic relationships, using a semantic knowledge base YAGO [16] extracted from Wikipedia and WordNet. Several methods [17], [18] were proposed for extracting paths between two concepts on an RDF graph whose edges represent explicit relationships with semantics.…”
Section: Related Workmentioning
confidence: 99%