Sciweavers

467 search results - page 54 / 94
» Processing top k queries from samples
Sort
View
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 9 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
PET
2010
Springer
13 years 11 months ago
Achieving Efficient Query Privacy for Location Based Services
Mobile smartphone users frequently need to search for nearby points of interest from a location based service, but in a way that preserves the privacy of the users' locations...
Femi G. Olumofin, Piotr K. Tysowski, Ian Goldberg,...
BMCBI
2011
13 years 22 days ago
Linear and non-linear dependencies between copy number aberrations and mRNA expression reveal distinct molecular pathways in Bre
Background: Elucidating the exact relationship between gene copy number and expression would enable identification of regulatory mechanisms of abnormal gene expression and biologi...
Hiroko K. Solvang, Ole Christian Lingjærde, ...
IPPS
2005
IEEE
14 years 2 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
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 9 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