Sciweavers

12697 search results - page 2251 / 2540
» Call for Papers
Sort
View
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
16 years 4 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
16 years 4 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
SIGMOD
2007
ACM
105views Database» more  SIGMOD 2007»
16 years 4 months ago
An XML transaction processing benchmark
XML database functionality has been emerging in "XML-only" databases as well as in the major relational database products. Yet, there is no industry standard XML databas...
Matthias Nicola, Irina Kogan, Berni Schiefer
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 4 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
16 years 4 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
« Prev « First page 2251 / 2540 Last » Next »