Sciweavers

123 search results - page 13 / 25
» Efficient B-tree Based Indexing for Cloud Data Processing
Sort
View
ICWS
2009
IEEE
13 years 5 months ago
An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...
Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang
EUROPAR
2008
Springer
13 years 9 months ago
A Search Engine Index for Multimedia Content
We present a distributed index data structure and algorithms devised to support parallel query processing of multimedia content in search engines. We present a comparative study wi...
Mauricio Marín, Veronica Gil Costa, Carolin...
SIGMOD
2003
ACM
163views Database» more  SIGMOD 2003»
14 years 7 months ago
Multi-Dimensional Clustering: A New Data Layout Scheme in DB2
We describe the design and implementation of a new data layout scheme, called multi-dimensional clustering, in DB2 Universal Database Version 8. Many applications, e.g., OLAP and ...
Sriram Padmanabhan, Bishwaranjan Bhattacharjee, Ti...
WWW
2007
ACM
14 years 8 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
IS
2007
13 years 7 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...