Sciweavers

2985 search results - page 125 / 597
» Indexing Distributed Complex Data for Complex Queries
Sort
View
JCST
2006
65views more  JCST 2006»
15 years 4 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
SIGIR
2004
ACM
15 years 10 months ago
An effective approach to document retrieval via utilizing WordNet and recognizing phrases
Noun phrases in queries are identified and classified into four types: proper names, dictionary phrases, simple phrases and complex phrases. A document has a phrase if all content...
Shuang Liu, Fang Liu, Clement T. Yu, Weiyi Meng
ICIP
1999
IEEE
16 years 6 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...
142
Voted
SIGMOD
2010
ACM
184views Database» more  SIGMOD 2010»
15 years 9 months ago
Load-balanced query dissemination in privacy-aware online communities
We propose a novel privacy-preserving distributed infrastructure in which data resides only with the publishers owning it. The infrastructure disseminates user queries to publishe...
Emiran Curtmola, Alin Deutsch, K. K. Ramakrishnan,...
WWW
2010
ACM
15 years 3 months ago
Evaluation Techniques for Generalized Path Pattern Queries on XML Data
Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path patt...
Xiaoying Wu, Dimitri Theodoratos, Stefanos Souldat...