Sciweavers

1782 search results - page 245 / 357
» Processing Queries over Distributed XML Databases
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Location cache for web queries
This paper proposes a strategy to reduce the amount of hardware involved in the solution of search engine queries. It proposes using a secondary compact cache that keeps minimal i...
Mauricio Marín, Flavio Ferrarotti, Marcelo ...
SIGMOD
2002
ACM
108views Database» more  SIGMOD 2002»
14 years 9 months ago
An adaptive peer-to-peer network for distributed caching of OLAP results
Peer-to-Peer (P2P) systems are becoming increasingly popular as they enable users to exchange digital information by participating in complex networks. Such systems are inexpensiv...
Panos Kalnis, Wee Siong Ng, Beng Chin Ooi, Dimitri...
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 9 months ago
The Piazza peer data management project
A major problem in today's information-driven world is that sharing heterogeneous, semantically rich data is incredibly difficult. Piazza is a peer data management system tha...
Igor Tatarinov, Zachary G. Ives, Jayant Madhavan, ...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 9 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 9 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu