Sciweavers

2145 search results - page 178 / 429
» Answering Queries Using Views
Sort
View
126
Voted
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
16 years 4 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
TCBB
2010
144views more  TCBB 2010»
14 years 10 months ago
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
Guillaume Blin, Florian Sikora, Stéphane Vi...
141
Voted
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 3 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
SIGIR
2004
ACM
15 years 9 months ago
Multiple sources of evidence for XML retrieval
Document-centric XML collections contain text-rich documents, marked up with XML tags. The tags add lightweight semantics to the text. Querying such collections calls for a hybrid...
Börkur Sigurbjörnsson, Jaap Kamps, Maart...
ICDE
2011
IEEE
262views Database» more  ICDE 2011»
14 years 7 months ago
Memory-constrained aggregate computation over data streams
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
K. V. M. Naidu, Rajeev Rastogi, Scott Satkin, Anan...