Sciweavers

2043 search results - page 304 / 409
» The Limits of Querying Ontologies
Sort
View
GIS
2010
ACM
13 years 9 months ago
Reverse k-Nearest Neighbor monitoring on mobile objects
In this paper we focus on the problem of continuously monitoring the set of Reverse k-Nearest Neighbors (RkNNs) of a query object in a moving object database using a client server...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
ICDT
2012
ACM
242views Database» more  ICDT 2012»
12 years 1 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
TKDE
2012
312views Formal Methods» more  TKDE 2012»
12 years 1 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
WWW
2008
ACM
14 years 11 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng
ADC
2005
Springer
135views Database» more  ADC 2005»
14 years 4 months ago
A Path-based Relational RDF Database
We propose a path-based scheme for storage and retrieval of RDF data using a relational database. The Semantic Web is much anticipated as the nextgeneration web where high-level p...
Akiyoshi Matono, Toshiyuki Amagasa, Masatoshi Yosh...