Sciweavers

2859 search results - page 357 / 572
» Querying Complex Structured Databases
Sort
View
153
Voted
P2P
2006
IEEE
211views Communications» more  P2P 2006»
15 years 8 months ago
Comparison of Image Similarity Queries in P2P Systems
Given some of the recent advances in Distributed Hash Table (DHT) based Peer-To-Peer (P2P) systems we ask the following questions: Are there applications where unstructured querie...
Wolfgang Müller 0002, P. Oscar Boykin, Nima S...
177
Voted
TKDE
2002
148views more  TKDE 2002»
15 years 2 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
202
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 3 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
110
Voted
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 2 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
122
Voted
ICWS
2007
IEEE
15 years 4 months ago
A Platform for Context Aware Runtime Web Service Discovery
In this paper we describe a platform that supports context aware runtime service discovery. The platform supports service discovery based on structural and behavioural service mod...
George Spanoudakis, Khaled Mahbub, Andrea Zisman