Sciweavers

277 search results - page 25 / 56
» Opportunistic Data Structures for Range Queries
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 3 months ago
Top-K Color Queries for Document Retrieval
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Marek Karpinski, Yakov Nekrich
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
14 years 1 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
RIAO
2007
13 years 10 months ago
XML Fragments Extended with Database Operators
XML documents represent a middle range between unstructured data such as textual documents and fully structured data encoded in databases. Typically, information retrieval techniq...
Yosi Mass, Dafna Sheinwald, Benjamin Sznajder, Siv...
TKDE
2010
190views more  TKDE 2010»
13 years 7 months ago
Effectively Indexing the Uncertain Space
—With the rapid development of various optical, infrared, and radar sensors and GPS techniques, there are a huge amount of multidimensional uncertain data collected and accumulat...
Ying Zhang, Xuemin Lin, Wenjie Zhang, Jianmin Wang...
EDBT
2009
ACM
110views Database» more  EDBT 2009»
14 years 1 months ago
A sampling approach for XML query selectivity estimation
As the Extensible Markup Language (XML) rapidly establishes itself as the de facto standard for presenting, storing, and exchanging data on the Internet, large volume of XML data ...
Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yu, Qia...