1461 search results - page 152 / 293 » The Cost of Cache-Oblivious Searching |
179
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
241
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
136
click to vote
IROS
2008
IEEE
16 years 25 days ago
2008
IEEE
— Flying has an advantage when compared to ground based locomotion, as it simplifies the task of overcoming obstacles and allows for rapid coverage of an area while also providi...
149
click to vote
LCTRTS
2004
Springer
15 years 11 months ago
2004
Springer
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
178
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
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...