Sciweavers

56 search results - page 9 / 12
» Dynamic Structures for Top- k Queries on Uncertain Data
Sort
View
IPPS
2005
IEEE
15 years 3 months ago
Distributed Data Streams Indexing using Content-Based Routing Paradigm
In recent years, we have seen a dramatic increase in the use of data-centric distributed systems such as global grid infrastructures, sensor networks, network monitoring, and vari...
Ahmet Bulut, Ambuj K. Singh, Roman Vitenberg
101
Voted
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
15 years 2 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
84
Voted
ISCC
2006
IEEE
129views Communications» more  ISCC 2006»
15 years 3 months ago
A Semantic Overlay Network for P2P Schema-Based Data Integration
Abstract— Today data sources are pervasive and their number is growing tremendously. Current tools are not prepared to exploit this unprecedented amount of information and to cop...
Carmela Comito, Simon Patarin, Domenico Talia
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
15 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
FOCS
2009
IEEE
15 years 1 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter