Sciweavers

353 search results - page 16 / 71
» Processing Top-k Join Queries
Sort
View
GEOINFO
2003
13 years 9 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
IJSWIS
2008
135views more  IJSWIS 2008»
13 years 8 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
MDM
2009
Springer
118views Communications» more  MDM 2009»
14 years 2 months ago
DigestJoin: Exploiting Fast Random Reads for Flash-Based Joins
Abstract—Flash disks have been an emerging secondary storage media. In particular, there have been portable devices, multimedia players and laptop computers that are configured ...
Yu Li, Sai Tung On, Jianliang Xu, Byron Choi, Haib...
SIGMOD
1995
ACM
80views Database» more  SIGMOD 1995»
13 years 11 months ago
Join Queries with External Text Sources: Execution and Optimization Techniques
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...
Surajit Chaudhuri, Umeshwar Dayal, Tak W. Yan
SSDBM
2006
IEEE
197views Database» more  SSDBM 2006»
14 years 1 months ago
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...
Derek Phillips, Ning Zhang 0002, Ihab F. Ilyas, M....