Sciweavers

486 search results - page 55 / 98
» An Efficient Path Index for Querying Semi-structured Data
Sort
View
ICDE
2005
IEEE
180views Database» more  ICDE 2005»
16 years 1 months ago
A Unified Framework for Monitoring Data Streams in Real Time
Online monitoring of data streams poses a challenge in many data-centric applications, such as telecommunications networks, traffic management, trend-related analysis, webclick st...
Ahmet Bulut, Ambuj K. Singh
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 1 days ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
EDBT
2006
ACM
191views Database» more  EDBT 2006»
15 years 12 months ago
Distributed Spatial Clustering in Sensor Networks
Abstract. Sensor networks monitor physical phenomena over large geographic regions. Scientists can gain valuable insight into these phenomena, if they understand the underlying dat...
Anand Meka, Ambuj K. Singh
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
15 years 3 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...
DAGSTUHL
2004
15 years 1 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...