Sciweavers

552 search results - page 88 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
162
Voted
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
15 years 12 months ago
Execution strategies for SQL subqueries
Optimizing SQL subqueries has been an active area in database research and the database industry throughout the last decades. Previous work has already identified some approaches ...
César A. Galindo-Legaria, Milind Joshi, Mos...
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
15 years 12 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
160
Voted
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 12 months ago
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs). The most recent GPU features include support for wr...
Bingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. ...
ARCS
2004
Springer
15 years 5 months ago
Latent Semantic Indexing in Peer-to-Peer Networks
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
Xuezheng Liu, Ming Chen, Guangwen Yang
PODS
2003
ACM
158views Database» more  PODS 2003»
15 years 12 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv