Sciweavers

191 search results - page 27 / 39
» XPath Query Evaluation: Improving Time and Space Efficiency
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
14 years 9 months ago
SAO: A Stream Index for Answering Linear Optimization Queries
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...
Gang Luo, Kun-Lung Wu, Philip S. Yu
VLDB
1998
ACM
87views Database» more  VLDB 1998»
14 years 19 days ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 3 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
TIME
1997
IEEE
14 years 19 days ago
On Effective Data Clustering in Bitemporal Databases
Temporal databases provide built-in supports for efficient recording and querying of time-evolving data. In this paper, data clustering issues in temporal database environment are...
Jong Soo Kim, Myoung-Ho Kim