Sciweavers

792 search results - page 19 / 159
» Computing Iceberg Queries Efficiently
Sort
View
SAC
2006
ACM
14 years 4 months ago
Efficient query routing for information retrieval in semantic overlays
A fundamental problem in peer-to-peer networks is how to locate appropriate peers efficiently to answer a specific query request. This paper proposes a model in which semantically...
Hai Jin, Xiaoming Ning, Hanhua Chen, Zuoning Yin
PVLDB
2008
154views more  PVLDB 2008»
13 years 9 months ago
Indexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...
Cyrus Shahabi, Lu-An Tang, Songhua Xing
ICDCS
2009
IEEE
13 years 7 months ago
Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases
The balance between privacy and utility is a classical problem with an increasing impact on the design of modern information systems. On the one side it is crucial to ensure that ...
Valentina Ciriani, Sabrina De Capitani di Vimercat...
PVLDB
2008
100views more  PVLDB 2008»
13 years 9 months ago
Efficiently approximating query optimizer plan diagrams
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
Atreyee Dey, Sourjya Bhaumik, Harish D., Jayant R....
FAW
2009
Springer
118views Algorithms» more  FAW 2009»
14 years 1 months ago
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Mostafa Nouri, Mohammad Ghodsi