Sciweavers

327 search results - page 49 / 66
» Efficiently querying rdf data in triple stores
Sort
View
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 10 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
SIGMOD
2008
ACM
103views Database» more  SIGMOD 2008»
14 years 8 months ago
XArch: archiving scientific and reference data
Database archiving is important for the retrieval of old versions of a database and for temporal queries over the history of data. We demonstrate XArch, a management system for ma...
Heiko Müller, Ioannis Koltsidas, Peter Bunema...
MOBICOM
2010
ACM
13 years 8 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
14 years 10 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande
SBBD
2004
89views Database» more  SBBD 2004»
13 years 10 months ago
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
Marcos R. Vieira, Caetano Traina Jr., Fabio Jun Ta...