Sciweavers

4337 search results - page 394 / 868
» Cache-Oblivious Query Processing
Sort
View
SSD
2007
Springer
243views Database» more  SSD 2007»
16 years 26 days ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
16 years 8 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
16 years 7 months ago
Column-stores vs. row-stores: how different are they really?
There has been a significant amount of excitement and recent work on column-oriented database systems ("column-stores"). These database systems have been shown to perfor...
Daniel J. Abadi, Samuel Madden, Nabil Hachem
ICDE
2005
IEEE
180views Database» more  ICDE 2005»
16 years 8 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
ICDE
2005
IEEE
101views Database» more  ICDE 2005»
16 years 8 months ago
GPIVOT: Efficient Incremental Maintenance of Complex ROLAP Views
Data warehousing and on-line analytical processing (OLAP) are essential for decision support applications. Common OLAP operations include for example drill down, roll up, pivot an...
Songting Chen, Elke A. Rundensteiner