Sciweavers

765 search results - page 102 / 153
» Query Processing over Incomplete Autonomous Databases
Sort
View
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
15 years 11 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
DAWAK
2001
Springer
15 years 2 months ago
Adaptable Similarity Search Using Vector Quantization
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
15 years 10 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
15 years 10 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
SIGMOD
2008
ACM
222views Database» more  SIGMOD 2008»
15 years 10 months ago
Tinycasper: a privacy-preserving aggregate location monitoring system in wireless sensor networks
This demo presents a privacy-preserving aggregate location monitoring system, namely, TinyCasper, in which we can monitor moving objects in wireless sensor networks while preservi...
Chi-Yin Chow, Mohamed F. Mokbel, Tian He