Sciweavers

329 search results - page 8 / 66
» Efficient Parallel Query Processing by Graph Ranking
Sort
View
VLDB
1989
ACM
155views Database» more  VLDB 1989»
15 years 1 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin
JSS
2008
139views more  JSS 2008»
14 years 9 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
PVLDB
2010
225views more  PVLDB 2010»
14 years 4 months ago
Efficient Processing of Top-k Spatial Preference Queries
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
107
Voted
DILS
2004
Springer
15 years 1 months ago
Efficient Techniques to Explore and Rank Paths in Life Science Data Sources
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...
Zoé Lacroix, Louiqa Raschid, Maria-Esther V...
PVLDB
2008
118views more  PVLDB 2008»
14 years 9 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...