5128 search results - page 219 / 1026 » An Efficient Storage Manager |
345
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
321
click to vote
ICDE
2005
IEEE
16 years 8 months ago
2005
IEEE
Order-based element labeling for tree-structured XML data is an important technique in XML processing. It lies at the core of many fundamental XML operations such as containment j...
194
click to vote
WWW
2001
ACM
16 years 7 months ago
2001
ACM
XML is poised to take the World-Wide-Web to the next level of innovation. XML data, large or small, with or without associated schema, will be exchanged between increasing number ...
193
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
189
click to vote
ICDE
2010
IEEE
16 years 7 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...