Sciweavers

649 search results - page 33 / 130
» Improved and Optimized Partitioning Techniques in Database Q...
Sort
View
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 4 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
16 years 3 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
BTW
1993
Springer
193views Database» more  BTW 1993»
15 years 6 months ago
Query Optimization in an OODBMS
It is clearly crucial for the success of object-oriented databases to find effiĆ cient implementations that improve on the performance of relational sysĆ tems, rather than being...
Christian Rich, Marc H. Scholl
RR
2007
Springer
15 years 8 months ago
Efficiently Querying Relational Databases Using OWL and SWRL
For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge t...
Martin J. O'Connor, Ravi Shankar, Samson W. Tu, Cs...
SIGMOD
2003
ACM
140views Database» more  SIGMOD 2003»
16 years 2 months ago
Stream Processing of XPath Queries with Predicates
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
Ashish Kumar Gupta, Dan Suciu