Sciweavers

707 search results - page 55 / 142
» Processing queries on tree-structured data efficiently
Sort
View
EDBT
2006
ACM
255views Database» more  EDBT 2006»
14 years 8 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
CCGRID
2004
IEEE
14 years 13 days ago
Serving queries to multi-resolution datasets on disk-based storage clusters
This paper is concerned with efficient querying of very large multi-resolution datasets on storage and compute clusters. We present a suite of services that support storage, index...
Xi Zhang, Tony Pan, Ümit V. Çataly&uum...
COMAD
2009
13 years 9 months ago
A Simple and Scalable Filter for XML Streams
XML stream querying problem involves evaluating a given, potentially large, set of query expressions on a continuous stream of XML messages. Since the messages arrive continuously...
Abdul Nizar, G. Suresh Babu, P. Sreenivasa Kumar
BMCBI
2010
160views more  BMCBI 2010»
13 years 8 months ago
Identification of functional hubs and modules by converting interactome networks into hierarchical ordering of proteins
Background: Protein-protein interactions play a key role in biological processes of proteins within a cell. Recent high-throughput techniques have generated protein-protein intera...
Young-Rae Cho, Aidong Zhang
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 10 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer