Sciweavers

1429 search results - page 83 / 286
» Efficient processing of XPath queries using indexes
Sort
View
ACSC
2004
IEEE
14 years 19 days ago
Access-Ordered Indexes
Search engines are an essential tool for modern life. We use them to discover new information on diverse topics and to locate a wide range of resources. The search process in all ...
Steven Garcia, Hugh E. Williams, Adam Cannane
EUROCAST
2007
Springer
122views Hardware» more  EUROCAST 2007»
14 years 24 days ago
Generation of Indexes for Compiling Efficient Parsers from Formal Specifications
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
Carlos Gómez-Rodríguez, Miguel A. Al...
ICDE
2008
IEEE
232views Database» more  ICDE 2008»
14 years 10 months ago
Continuous Content-Based Copy Detection over Streaming Videos
Digital videos are increasingly adopted in various multimedia applications where they are usually broadcasted or transmitted as video streams. Continuously monitoring copies on the...
Ying Yan, Beng Chin Ooi, Aoying Zhou
VLDB
1995
ACM
97views Database» more  VLDB 1995»
14 years 13 days ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
PVLDB
2008
108views more  PVLDB 2008»
13 years 8 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...