Sciweavers

2889 search results - page 4 / 578
» Querying Structured Hyperdocuments
Sort
View
SIAMCOMP
2012
13 years 5 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
COMSIS
2010
15 years 18 days ago
MFI-tree: An effective multi-feature index structure for weighted query application
Multi-Feature Index Tree (MFI-Tree), a new indexing structure, is proposed to index multiple high-dimensional features of video data for video retrieval through example. MFI-Tree e...
Yunfeng He, Junqing Yu
TISSEC
2010
129views more  TISSEC 2010»
14 years 10 months ago
Authenticated Index Structures for Aggregation Queries
Feifei Li, Marios Hadjieleftheriou, George Kollios...
DATESO
2009
119views Database» more  DATESO 2009»
15 years 1 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
SIGIR
2010
ACM
15 years 1 months ago
DivQ: diversification for keyword search over structured databases
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
Elena Demidova, Peter Fankhauser, Xuan Zhou, Wolfg...