Sciweavers

1179 search results - page 229 / 236
» Relational-style XML query
Sort
View
SIGIR
2006
ACM
14 years 1 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
ICAIL
2005
ACM
14 years 1 months ago
A study of accrual of arguments, with applications to evidential reasoning
d on Dung’s [4] abstract argumentation system • arguments: trees of chained defeasible inferences • aim: determine the status of a query given a belief base • incorporation...
Henry Prakken
ESWS
2005
Springer
14 years 1 months ago
RELFIN - Topic Discovery for Ontology Enhancement and Annotation
While classic information retrieval methods return whole documents as a result of a query, many information demands would be better satisfied by fine-grain access inside the docu...
Markus Schaal, Roland M. Müller, Marko Brunze...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 3 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
14 years 8 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...