Sciweavers

517 search results - page 21 / 104
» Efficient Computation of Diverse Query Results
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
ICEIS
2006
IEEE
14 years 1 months ago
Filtering Unsatisfiable XPATH Queries
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
Jinghua Groppe, Sven Groppe
DASFAA
2010
IEEE
176views Database» more  DASFAA 2010»
13 years 7 months ago
Efficient Database-Driven Evaluation of Security Clearance for Federated Access Control of Dynamic XML Documents
Achieving data security over cooperating web services is becoming a reality, but existing XML access control architectures do not consider this federated service computing. In this...
Erwin Leonardi, Sourav S. Bhowmick, Mizuho Iwaihar...
SIGMOD
2003
ACM
162views Database» more  SIGMOD 2003»
14 years 7 months ago
DBGlobe: a service-oriented P2P system for global computing
The challenge of peer-to-peer computing goes beyond simple file sharing. In the DBGlobe project, we view the multitude of peers carrying data and services as a superdatabase. Our ...
Evaggelia Pitoura, Serge Abiteboul, Dieter Pfoser,...
SIGMOD
2003
ACM
1527views Database» more  SIGMOD 2003»
14 years 7 months ago
XPRESS: A Queriable Compression for XML Data
Like HTML, many XML documents are resident on native file systems. Since XML data is irregular and verbose, the disk space and the network bandwidth are wasted. To overcome the ve...
Jun-Ki Min, Myung-Jae Park, Chin-Wan Chung