Sciweavers

120 search results - page 2 / 24
» Efficient and Effective Query Answering in a PDMS with SUNRI...
Sort
View
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 3 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 5 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
TKDE
2012
312views Formal Methods» more  TKDE 2012»
11 years 7 months ago
Efficient Fuzzy Type-Ahead Search in XML Data
—In a traditional keyword-search system over XML data, a user composes a keyword query, submits it to the system, and retrieves relevant answers. In the case where the user has l...
Jianhua Feng, Guoliang Li
CIKM
2010
Springer
13 years 3 months ago
Index structures for efficiently searching natural language text
Many existing indexes on text work at the document granularity and are not effective in answering the class of queries where the desired answer is only a term or a phrase. In this...
Pirooz Chubak, Davood Rafiei
MDM
2010
Springer
281views Communications» more  MDM 2010»
13 years 7 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...