Sciweavers

649 search results - page 73 / 130
» Improved and Optimized Partitioning Techniques in Database Q...
Sort
View
124
Voted
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
16 years 3 months ago
Similarity Search on Supergraph Containment
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
15 years 8 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
148
Voted
CIKM
2009
Springer
15 years 7 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
146
Voted
WWW
2008
ACM
16 years 4 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
120
Voted
ANLP
1994
86views more  ANLP 1994»
15 years 5 months ago
Robust Text Processing in Automated Information Retrieval
We report on the results of a series of experiments with a prototype text retrieval system which uses relatively advanced natural language processing techniques in order to enhanc...
Tomek Strzalkowski